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