Hypergraph Turán numbers of linear cycles
From MaRDI portal
Publication:2434896
DOI10.1016/j.jcta.2013.12.009zbMath1280.05095arXiv1302.2387WikidataQ105583642 ScholiaQ105583642MaRDI QIDQ2434896
Publication date: 31 January 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2387
Related Items
On Tight Cycles in Hypergraphs, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, Supersaturation of even linear cycles in linear hypergraphs, Ramsey Numbers for Nontrivial Berge Cycles, Large hypergraphs without tight cycles, Hypergraphs with no tight cycles, Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs, Turán Problems and Shadows III: Expansions of Graphs, Extremal Results for Berge Hypergraphs, Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs, Linear cycles of consecutive lengths, Dirac-type conditions for spanning bounded-degree hypertrees, Turán problems and shadows. II: Trees, Turán problems and shadows. I: Paths and cycles, The number of hypergraphs without linear cycles, On hypergraphs without loose cycles, Cycles of given lengths in hypergraphs, Turán numbers for Berge-hypergraphs and related extremal problems, Relative Turán numbers for hypergraph cycles, Hypergraph Turán numbers of vertex disjoint cycles, Turán numbers for hypergraph star forests, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, On extremal hypergraphs for forests of tight paths, Extremal Theta-free planar graphs, Planar Turán numbers of short paths, The Turán number of disjoint copies of paths, Turán numbers of complete 3-uniform Berge-hypergraphs, Extremal \(H\)-free planar graphs, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs, The structure of large intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- On matchings in hypergraphs
- Turán problems and shadows. I: Paths and cycles
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- On finite set-systems whose every intersection is a kernel of a star
- Exact solution of some Turán-type problems
- Proof of a conjecture of Erdős on triangles in set-systems
- Minimal paths and cycles in set systems
- Linear trees in uniform hypergraphs
- Hypergraph Extensions of the Erdős-Gallai Theorem
- On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
- The Size of a Hypergraph and its Matching Number
- Set Systems without a Strong Simplex
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On families of finite sets no two of which intersect in a singleton
