On 3-uniform hypergraphs without a cycle of a given length
From MaRDI portal
Publication:516784
DOI10.1016/j.dam.2016.10.013zbMath1358.05203arXiv1412.8083OpenAlexW2962990090MaRDI QIDQ516784
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.8083
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Triple systems (05B07)
Related Items (30)
Turán numbers for hypergraph star forests ⋮ Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ Multicolor Turán numbers ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ The maximum number of paths of length four in a planar graph ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ The maximum number of cliques in graphs without long cycles ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ Phase transitions in a power-law uniform hypergraph ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ 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 ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ Turán number of special four cycles in triple systems ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Limiting distribution of short cycles in inhomogeneous random uniform hypergraph ⋮ Saturation of Berge hypergraphs ⋮ Cycles of given lengths in hypergraphs ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Spectral extremal results for hypergraphs ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ The regularity method for graphs with few 4‐cycles
Cites Work
- Unnamed Item
- 3-uniform hypergraphs avoiding a given odd cycle
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- On the number of \(C_ 5's\) in a triangle-free graph
- Cycles of even length in graphs
- On the number of pentagons in triangle-free graphs
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- 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
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- On a problem of K. Zarankiewicz
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: On 3-uniform hypergraphs without a cycle of a given length
