Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
From MaRDI portal
Publication:1713504
DOI10.1016/j.jcta.2018.12.004zbMath1403.05107arXiv1705.03561OpenAlexW2964027893WikidataQ114162694 ScholiaQ114162694MaRDI QIDQ1713504
Beka Ergemlidze, Abhishek Methuku, Ervin Gyoeri
Publication date: 25 January 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.03561
Related Items (20)
The exact linear Turán number of the sail ⋮ Turán numbers for hypergraph star forests ⋮ Multicolor Turán numbers ⋮ The weighted hypergraph with the maximum spectral radius ⋮ Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$ ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Linear cycles of consecutive lengths ⋮ On the spectral radius of uniform weighted hypergraph ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Saturation of Berge hypergraphs ⋮ Relative Turán numbers for hypergraph cycles ⋮ Spectral extremal results for hypergraphs ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ On 2-connected hypergraphs with no long cycles ⋮ Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs ⋮ Multicolor Ramsey numbers for Berge cycles ⋮ A linear hypergraph extension of Turán's theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Turán numbers of bipartite graphs plus an odd cycle
- 3-uniform hypergraphs avoiding a given odd cycle
- On 3-uniform hypergraphs without a cycle of a given length
- Pentagons vs. triangles
- On hypergraphs of girth five
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- A note on the maximum number of triangles in a \(C_5\)-free graph
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- On the existence of triangulated spheres in 3-graphs, and related problems
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- A new series of dense graphs of high girth
- 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
- Extremal Results for Berge Hypergraphs
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
This page was built for publication: Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
