Covering and tiling hypergraphs with tight cycles
From MaRDI portal
Publication:4993263
DOI10.1017/S0963548320000449zbMath1466.05182MaRDI QIDQ4993263
Nicolás Sanhueza-Matamala, Allan Lo, Jie Han
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal combinatorics (05D99)
Related Items
Hamiltonicity in cherry-quasirandom 3-graphs, Dirac-type results for tilings and coverings in ordered graphs, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, Minimum degree conditions for tight Hamilton cycles, Towards Lehel's conjecture for 4-uniform tight cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight cycles and regular slices in dense hypergraphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Proof of the Erdős-Faudree conjecture on quadrilaterals
- On circuits in graphs
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Tiling Turán theorems
- \(H\)-factors in dense graphs
- \(F\)-factors in hypergraphs via absorption
- On extremal problems of graphs and generalized graphs
- Codegree Thresholds for Covering 3-Uniform Hypergraphs
- Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs
- Recent advances on Dirac-type problems for hypergraphs
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
- Disjoint 5-cycles in a graph
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
- Matchings in hypergraphs of large minimum degree
- A geometric theory for hypergraph matching
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- On a problem of K. Zarankiewicz
- Proof of the Alon-Yuster conjecture
