Hypergraphs with no tight cycles

DOI10.1090/PROC/16043OpenAlexW4214914914MaRDI QIDQ5055605

Shoham Letzter

Publication date: 9 December 2022

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphtight cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Small complete minors above the extremal edge density
• 3-uniform hypergraphs avoiding a given odd cycle
• Turán problems and shadows. I: Paths and cycles
• Counting substructures. II: Hypergraphs
• Tight cycles and regular slices in dense hypergraphs
• Exact solution of some Turán-type problems
• Cycles of given lengths in hypergraphs
• On extremal problems of graphs and generalized graphs
• Hypergraph Turán numbers of linear cycles
• Hypergraphs with No Cycle of a Given Length
• Extremal problems for cycles in graphs
• On Tight Cycles in Hypergraphs
• Supersaturation of even linear cycles in linear hypergraphs
• Large hypergraphs without tight cycles
• The Extremal Number of Tight Cycles

Related Items (7)

Large hypergraphs without tight cycles ⋮ Euler tours in hypergraphs ⋮ Bipartite-ness under smooth conditions ⋮ Uniform Turán density of cycles ⋮ Rainbow subdivisions of cliques ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

This page was built for publication: Hypergraphs with no tight cycles