The degree and codegree threshold for linear triangle covering in 3-graphs
From MaRDI portal
Publication:6197321
DOI10.37236/11717arXiv2212.03718MaRDI QIDQ6197321
Unnamed Author, Xin Min Hou, Yue Ma
Publication date: 16 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.03718
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Cites Work
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering
- Codegree Thresholds for Covering 3-Uniform Hypergraphs
- 3-Uniform Hypergraphs and Linear Cycles
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition
- Dirac-type results for tilings and coverings in ordered graphs
- Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs
This page was built for publication: The degree and codegree threshold for linear triangle covering in 3-graphs
