Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering

DOI10.37236/8784zbMath1445.05086arXiv2002.00353OpenAlexW3082474995MaRDI QIDQ785570

Yue Ma, Boyuan Liu, Lei Yu, Xin Min Hou

Publication date: 7 August 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

coveringextremal graphs3-graphscodegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The degree and codegree threshold for linear triangle covering in 3-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• Covering and tiling hypergraphs with tight cycles
• Co-degree density of hypergraphs
• Codegree Thresholds for Covering 3-Uniform Hypergraphs

This page was built for publication: Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering