3-uniform hypergraphs avoiding a given odd cycle

DOI10.1007/s00493-012-2584-4zbMath1299.05247OpenAlexW2021875446MaRDI QIDQ452824

Nathan Lemons, Ervin Gyoeri

Publication date: 17 September 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-012-2584-4

zbMATH Keywords

3-uniform hypergrahpsavoidinig odd cycleBerge cycle

Mathematics Subject Classification ID

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

Related Items (34)

Turán numbers for hypergraph star forests ⋮ Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ Hypergraphs with no tight cycles ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Turán numbers of complete 3-uniform Berge-hypergraphs ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Induced Turán problems and traces of hypergraphs ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Generalized Turán problems for even cycles ⋮ Extremal Results for Berge Hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ Turán problems and shadows. I: Paths and cycles ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On the cover Turán number of Berge hypergraphs ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ Saturation of Berge hypergraphs ⋮ An Erdős-Gallai type theorem for vertex colored graphs ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Cycles of given lengths in hypergraphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ Multicolor Ramsey numbers for Berge cycles

Cites Work

• Pentagons vs. triangles
• On hypergraphs of girth five
• Cycles of even length in graphs
• On maximal paths and circuits of graphs
• Triangle-Free Hypergraphs
• Decomposition of Finite Graphs Into Forests
• On the structure of linear graphs

This page was built for publication: 3-uniform hypergraphs avoiding a given odd cycle