Covering and tiling hypergraphs with tight cycles

DOI10.1017/S0963548320000449MaRDI QIDQ4993263zbMATH OpenFDO

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

Publication date 15 June 2021

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548320000449

zbMATH Keywords

\(k\)-uniform tight cycleperfect \(F\)-tiling

Mathematics Subject Classification ID

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

Recommendations

• Covering and tiling hypergraphs with tight cycles
• Tight cycles in hypergraphs
• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
• Tight co-degree condition for packing of loose cycles in 3-graphs
• Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs

Cites work

• \(F\)-factors in hypergraphs via absorption
• \(H\)-factors in dense graphs
• A geometric theory for hypergraph matching
• A note on codegree problems for hypergraphs
• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
• Codegree thresholds for covering 3-uniform hypergraphs
• Disjoint 5-cycles in a graph
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Matchings in hypergraphs of large minimum degree
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• On a problem of K. Zarankiewicz
• On circuits in graphs
• On extremal problems of graphs and generalized graphs
• On the maximal number of independent circuits in a graph
• Packing k-partite k-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Proof of the Alon-Yuster conjecture
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Recent advances on Dirac-type problems for hypergraphs
• Some Theorems on Abstract Graphs
• The Ramsey number for 3-uniform tight hypergraph cycles
• Tight co-degree condition for packing of loose cycles in 3-graphs
• Tight cycles and regular slices in dense hypergraphs
• Tiling Turán theorems

Cited in

(16)

• Covering and tiling hypergraphs with tight cycles
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• Towards Lehel's conjecture for 4-uniform tight cycles
• Hamiltonicity in cherry-quasirandom 3-graphs
• Tight co-degree condition for packing of loose cycles in 3-graphs
• Tight cycles in hypergraphs
• On tight cycles in hypergraphs
• Dirac-type results for tilings and coverings in ordered graphs
• Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
• Tight cycles and regular slices in dense hypergraphs
• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
• Komlós's tiling theorem via graphon covers
• Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
• Minimum degree conditions for tight Hamilton cycles
• Cycle decompositions in \(k\)-uniform hypergraphs
• The codegree Turán density of 3-uniform tight cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993263)