Edge-decompositions of graphs with high minimum degree
From MaRDI portal
Publication:5899605
DOI10.1016/j.aim.2015.09.032zbMath1328.05145arXiv1410.5750OpenAlexW1855200107MaRDI QIDQ5899605
Allan Lo, Ben Barber, Daniela Kühn, Deryk Osthus
Publication date: 23 December 2015
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5750
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items
Clique decompositions of multipartite graphs and completion of Latin squares, Decompositions of complete graphs into bipartite 2-regular subgraphs, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Packing spanning graphs from separable families, Dense Eulerian graphs are \((1, 3)\)-choosable, Leaves for packings with block size four, Fractional clique decompositions of dense graphs and hypergraphs, Fractional cycle decompositions in hypergraphs, Matching divisible designs with block size four, Threshold for Steiner triple systems, On determining when small embeddings of partial Steiner triple systems exist, Graph and hypergraph packing, Minimalist designs, Fractional Clique Decompositions of Dense Partite Graphs, Progress towards Nash-Williams' conjecture on triangle decompositions, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Countable homogeneous Steiner triple systems avoiding specified subsystems, A blow-up lemma for approximate decompositions, A proof of the Barát-Thomassen conjecture, Clumsy packings of graphs, Resolution of the Oberwolfach problem, On the Minimum Degree Required for a Triangle Decomposition, Sharp bounds for decomposing graphs into edges and triangles, Constructions and uses of incomplete pairwise balanced designs, On the decomposition threshold of a given graph, Transversal factors and spanning trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Combinatorial and computational aspects of graph packing and graph decomposition
- Corrigendum to ``Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- A fast algorithm for equitable coloring
- Integer and fractional packings in dense graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- \(H\)-factors in dense graphs
- \(H\)-packing of \(k\)-chromatic graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Clique decompositions of multipartite graphs and completion of Latin squares
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
- Edge-Disjoint Cliques in Graphs with High Minimum Degree
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Triangle Factors in Random Graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Integer and fractional packing of families of graphs
- The decomposition threshold for bipartite graphs with minimum degree one
- Decomposing Graphs of High Minimum Degree into 4‐Cycles
- Fractional Clique Decompositions of Dense Partite Graphs
- On the structure of linear graphs
