The minimum degree threshold for perfect graph packings
From MaRDI portal
Publication:2149489
Recommendations
Cites work
- K4−‐factor in a graph
- \(H\)-factors in dense graphs
- Blow-up lemma
- Critical chromatic number and the complexity of perfect packings in graphs
- scientific article; zbMATH DE number 3743308 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Large planar subgraphs in dense graphs
- Maximum bounded \(H\)-matching is Max SNP-complete
- On the Complexity of General Graph Factor Problems
- On the maximal number of independent circuits in a graph
- Perfect packings with complete graphs minus an edge
- Proof of a tiling conjecture of Komlós
- Proof of the Alon-Yuster conjecture
- Refining the graph density condition for the existence of almost K-factors
- The Blow-up Lemma
- Tiling Turán theorems
Cited in
(84)- 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
- \(H\)-packing of \(k\)-chromatic graphs
- On multipartite Hajnal-Szemerédi theorems
- On perfect packings in dense graphs
- 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
- Perfect packings with complete graphs minus an edge
- A degree sequence Hajnal-Szemerédi theorem
- Spanning trees in dense directed graphs
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph
- Perfect packings in quasirandom hypergraphs. I.
- Codegree thresholds for covering 3-uniform hypergraphs
- Minimum degree conditions for large subgraphs
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- The complexity of perfect packings in dense graphs
- Tiling directed graphs with tournaments
- Embedding graphs having Ore-degree at most five
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An Ore-type theorem for perfect packings in graphs
- A blow-up lemma for approximate decompositions
- Packings in Dense Regular Graphs
- On the KŁR conjecture in random graphs
- Towards a weighted version of the Hajnal-Szemerédi theorem
- 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
- Minimum vertex degree thresholds for tiling complete 3-partite 3-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 for \(C_6^3\)-factors in 3-uniform hypergraphs
- Exact minimum codegree threshold for K^-_4-factors
- Transversal factors and spanning trees
- On deficiency problems for graphs
- Embedding clique-factors in graphs with low -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
- The minimum degree threshold for perfect graph packings
- Tiling edge-ordered graphs with monotone paths and other structures
- Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
- 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
- Optimal spread for spanning subgraphs of Dirac hypergraphs
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Spanning subdivisions in Dirac graphs
- Sufficient conditions for perfect mixed tilings
- Spanning subdivisions in dense digraphs
- Nearly Hamilton cycles in sublinear expanders and applications
- Transversals via regularity
- On perfect subdivision tilings
- List packing number of bounded degree graphs
- Counting spanning subgraphs in dense hypergraphs
- Stability of transversal Hamilton cycles and paths
- Transversal panconnectedness in graph collections
- Ramsey-type problems for tilings in dense graphs
- On perfect subdivision tilings (extended abstract)
- Tiling dense hypergraphs (extended abstract)
- A general approach to transversal versions of Dirac-type theorems (extended abstract)
- Tiling problems in edge-ordered graphs (extended abstract)
- Transversal Hamilton paths and cycles
- Bandwidth theorem for random graphs
- Packing k-partite k-uniform hypergraphs
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)
