A note on the Tur\'an number of a Berge odd cycle
From MaRDI portal
Publication:4990118
zbMath1465.05120arXiv1903.01002MaRDI QIDQ4990118
Publication date: 28 May 2021
Full work available at URL: https://arxiv.org/abs/1903.01002
Related Items (1)
Cites Work
- 3-uniform hypergraphs avoiding a given odd cycle
- On 3-uniform hypergraphs without a cycle of a given length
- Pentagons vs. triangles
- The maximum number of cliques in graphs without long cycles
- Cycles of given lengths in hypergraphs
- General lemmas for Berge-Turán hypergraph problems
- Turán numbers for Berge-hypergraphs and related extremal problems
- 3-uniform hypergraphs without a cycle of length five
- Avoiding long Berge cycles
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting copies of a fixed subgraph in \(F\)-free graphs
- The Maximum Number of Triangles in C2k+1-Free Graphs
- Hypergraphs with No Cycle of a Given Length
- On maximal paths and circuits of graphs
- Triangle-Free Hypergraphs
- Extremal Results for Berge Hypergraphs
- Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: A note on the Tur\'an number of a Berge odd cycle
