Codegree Thresholds for Covering 3-Uniform Hypergraphs

DOI10.1137/15M1051452zbMath1346.05199arXiv1512.01144OpenAlexW2189228222MaRDI QIDQ2826217

Yi Zhao, Victor Falgas-Ravry

Publication date: 10 October 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

coveringextremal graphs3-graphscodegree

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal combinatorics (05D99)

Related Items (8)

Dirac-type results for tilings and coverings in ordered graphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ The degree and codegree threshold for linear triangle covering in 3-graphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the codegree density of complete 3-graphs and related problems
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• An exact result for 3-graphs
• 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
• The codegree threshold of \(K_4^-\)
• On the Turán number of triple systems
• Minimum codegree threshold for \((K^3_4-e)\)-factors
• The minimum degree threshold for perfect graph packings
• \(F\)-factors in hypergraphs via absorption
• Codegree problems for projective geometries
• On the co-degree threshold for the Fano plane
• The co-degree density of the Fano plane
• Co-degree density of hypergraphs
• Codegree Thresholds for Covering 3-Uniform Hypergraphs
• Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs
• Tiling 3-Uniform Hypergraphs With K43−2e
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• Recent advances on Dirac-type problems for hypergraphs
• A hypergraph regularity method for generalized Turán problems
• Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs
• Exact Minimum Codegree Threshold for K⁻₄-Factors
• A geometric theory for hypergraph matching

This page was built for publication: Codegree Thresholds for Covering 3-Uniform Hypergraphs