Tiling 3-Uniform Hypergraphs With K43−2e

DOI10.1002/jgt.21726zbMath1280.05093arXiv1108.4140OpenAlexW1492438130MaRDI QIDQ2874094

Louis DeBiasio, Brendan Nagle, Andrzej Czygrinow

Publication date: 28 January 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.4140

zbMATH Keywords

absorbinghypergraphstilinghypergraph regularityDirac's theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (20)

Perfect packings in quasirandom hypergraphs. I. ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Exact Minimum Codegree Threshold for K⁻₄-Factors ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs ⋮ Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ \(F\)-factors in hypergraphs via absorption ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

Cites Work

• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Minimum codegree threshold for \((K^3_4-e)\)-factors
• On extremal problems of graphs and generalized graphs

This page was built for publication: Tiling 3-Uniform Hypergraphs With K43−2e