The minimum degree threshold for perfect graph packings
From MaRDI portal
Publication:2149489
DOI10.1007/s00493-009-2254-3MaRDI 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
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A blow-up lemma for approximate decompositions, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Triangle‐factors in pseudorandom graphs, Dirac-type results for tilings and coverings in ordered graphs, Minimalist designs, A rainbow blow‐up lemma, A rainbow blow-up lemma for almost optimally bounded edge-colourings, The bandwidth theorem for locally dense 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, A Degree Sequence Komlós Theorem, An Extension of the Blow-up Lemma to Arrangeable Graphs, An Asymptotic Multipartite Kühn--Osthus Theorem, On Directed Versions of the Hajnal–Szemerédi Theorem, Perfect Packings in Quasirandom Hypergraphs II, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Exact Minimum Codegree Threshold for K−4-Factors, A median-type condition for graph tiling, Transversal factors and spanning trees, On deficiency problems for 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, Clique-factors in graphs with sublinear -independence number, Factors in randomly perturbed hypergraphs, A general approach to transversal versions of Dirac‐type theorems, A Ramsey–Turán theory for tilings in graphs, A degree sequence Hajnal-Szemerédi theorem, Perfect packings in quasirandom hypergraphs. I., On the KŁR conjecture in random graphs, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, Bandwidth theorem for random graphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Tiling tripartite graphs with 3-colorable graphs: the extreme case, Star-factors in graphs with large minimum degree, On multipartite Hajnal-Szemerédi theorems, Tilings in vertex ordered graphs, 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, The complexity of perfect matchings and packings in dense hypergraphs, Rainbow factors in hypergraphs, Asymptotic multipartite version of the Alon-Yuster theorem, Spanning trees in dense directed graphs, Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Minimum degree conditions for large subgraphs, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
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