Covering and tiling hypergraphs with tight cycles

DOI10.1016/j.endm.2017.07.008zbMath1379.05082arXiv1701.08115OpenAlexW2585665079MaRDI QIDQ1689974

Jie Han, Allan Lo, Nicolás Sanhueza-Matamala

Publication date: 18 January 2018

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

zbMATH Keywords

coveringhypergraphstilingtight cyclescodegree threshold

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ 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
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• On circuits in graphs
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• \(F\)-factors in hypergraphs via absorption
• On extremal problems of graphs and generalized graphs
• Codegree Thresholds for Covering 3-Uniform Hypergraphs
• Recent advances on Dirac-type problems for hypergraphs
• Matchings in hypergraphs of large minimum degree
• A geometric theory for hypergraph matching

This page was built for publication: Covering and tiling hypergraphs with tight cycles