Exact Minimum Codegree Threshold for K−4-Factors
From MaRDI portal
Publication:5373833
DOI10.1017/S0963548317000268zbMath1374.05176arXiv1509.02577OpenAlexW2963274279MaRDI QIDQ5373833
Allan Lo, Jie Han, Yi Zhao, Andrew Treglown
Publication date: 27 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.02577
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Cites Work
- Unnamed Item
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Supersaturated graphs and hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- The minimum degree threshold for perfect graph packings
- \(F\)-factors in hypergraphs via absorption
- On extremal problems of graphs and generalized graphs
- Tiling 3-Uniform Hypergraphs With K43−2e
- Recent advances on Dirac-type problems for hypergraphs
- Hypergraphs Do Jump
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Embedding large subgraphs into dense graphs
- Degrees giving independent edges in a hypergraph
- Minimum Vertex Degree Threshold for ‐tiling*
- Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs
- A geometric theory for hypergraph matching
This page was built for publication: Exact Minimum Codegree Threshold for K−4-Factors
