Covering and tiling hypergraphs with tight cycles

DOI10.1017/S0963548320000449zbMATH Open1466.05182MaRDI QIDQ4993263FDOQ4993263

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)

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

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)

Cites Work

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

Cited In (10)

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

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)