Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs

DOI10.1002/jgt.21998zbMath1350.05134OpenAlexW1867281446MaRDI QIDQ2833250

Andrzej Czygrinow

Publication date: 17 November 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21998

zbMATH Keywords

hypergraphsloose cycles

Mathematics Subject Classification ID

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

Related Items (7)

Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs

Cites Work

• Unnamed Item
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• On extremal problems of graphs and generalized graphs
• Tiling 3-Uniform Hypergraphs With K43−2e
• Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• On the maximal number of independent circuits in a graph
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs