Tight cycles in hypergraphs

DOI10.1016/J.ENDM.2015.06.091MaRDI QIDQ322350zbMATHOpenAlexFDO

Authors P. Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

Publication date 14 October 2016

Full work available at URL https://arxiv.org/pdf/1411.4957

zbMATH Keywords

regularity methodhypergraphstight cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• Tight cycles and regular slices in dense hypergraphs
• On tight cycles in hypergraphs
• Large hypergraphs without tight cycles
• Hypergraphs with no tight cycles
• Covering and tiling hypergraphs with tight cycles

Cites work

• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Hamiltonicity in balanced \(k\)-partite graphs
• Hypergraph extensions of the Erdős-Gallai theorem
• On Hamiltonian bipartite graphs
• On maximal paths and circuits of graphs
• Pancyclic graphs. I
• Tight cycles in hypergraphs

Cited in

(13)

• Hypergraphs with no tight cycles
• Fractional cycle decompositions in hypergraphs
• Covering and tiling hypergraphs with tight cycles
• The Extremal Number of Tight Cycles
• Hypergraph Ramsey numbers: tight cycles versus cliques
• Covering and tiling hypergraphs with tight cycles
• Large hypergraphs without tight cycles
• Tight paths in convex geometric hypergraphs
• Tight cycles and regular slices in dense hypergraphs
• Regular slices for hypergraphs
• Tight cycles in hypergraphs
• The codegree Turán density of tight cycles minus one edge
• On tight cycles in hypergraphs

This page was built for publication: Tight cycles in hypergraphs

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