Hypergraphs with no cycle of length 4

DOI10.1016/J.DISC.2011.06.027zbMath1239.05132OpenAlexW2054472436MaRDI QIDQ411654

Nathan Lemons, Ervin Gyoeri

Publication date: 30 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.027

zbMATH Keywords

cyclesextremal graphsextremal hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (8)

Turán numbers for hypergraph star forests ⋮ A note on the maximum size of Berge-\( C_4\)-free hypergraphs ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Phase transitions in a power-law uniform hypergraph ⋮ Extremal Results for Berge Hypergraphs ⋮ Limiting distribution of short cycles in inhomogeneous random uniform hypergraph ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ On the weight of Berge-\(F\)-free hypergraphs

Cites Work

• Pentagons vs. triangles
• On hypergraphs of girth five
• On maximal paths and circuits of graphs
• Triangle-Free Hypergraphs

This page was built for publication: Hypergraphs with no cycle of length 4