Large hypergraphs without tight cycles

DOI10.5070/C61055374zbMath1498.05193arXiv2012.07726OpenAlexW4206094333MaRDI QIDQ5048449

Barnabás Janzer

Publication date: 16 November 2022

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.07726

Mathematics Subject Classification ID

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

Related Items (4)

Hypergraphs with no tight cycles ⋮ Uniform Turán density of cycles ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

Cites Work

• Turán problems and shadows. I: Paths and cycles
• Pentagons vs. triangles
• Cycles of given lengths in hypergraphs
• Hypergraph Turán numbers of linear cycles
• Hypergraphs with No Cycle of a Given Length
• Extremal problems for cycles in graphs
• Triangle-Free Hypergraphs
• On Tight Cycles in Hypergraphs

This page was built for publication: Large hypergraphs without tight cycles