The minimum degree threshold for perfect graph packings
From MaRDI portal
Publication:2149489
DOI10.1007/s00493-009-2254-3OpenAlexW2014564484MaRDI QIDQ2149489
Publication date: 29 June 2022
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603665
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (52)
An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ On deficiency problems for graphs ⋮ Tilings in vertex ordered graphs ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ Spanning trees in dense directed graphs ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Graph Tilings in Incompatibility Systems ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Factors in randomly perturbed hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ A degree sequence version of the Kühn-Osthus tiling theorem ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Minimalist designs ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ A rainbow blow‐up lemma ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ The bandwidth theorem for locally dense graphs ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A blow-up lemma for approximate decompositions ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ A median-type condition for graph tiling ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Star-factors in graphs with large minimum degree ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Rainbow factors in hypergraphs ⋮ Triangle‐factors in pseudorandom graphs ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ On Komlós’ tiling theorem in random graphs ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Bandwidth theorem for random graphs ⋮ A Degree Sequence Komlós Theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Minimum degree conditions for large subgraphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Transversal factors and spanning trees ⋮ A degree sequence Hajnal-Szemerédi theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum bounded \(H\)-matching is Max SNP-complete
- Blow-up lemma
- Tiling Turán theorems
- \(H\)-factors in dense graphs
- Perfect packings with complete graphs minus an edge
- Large planar subgraphs in dense graphs
- On the Complexity of General Graph Factor Problems
- Critical chromatic number and the complexity of perfect packings in graphs
- The Blow-up Lemma
- Proof of a tiling conjecture of Komlós
- K4−‐factor in a graph
- On the maximal number of independent circuits in a graph
- Proof of the Alon-Yuster conjecture
This page was built for publication: The minimum degree threshold for perfect graph packings
