Hypergraph Turán numbers of linear cycles
From MaRDI portal
Publication:2434896
DOI10.1016/j.jcta.2013.12.009zbMath1280.05095arXiv1302.2387OpenAlexW1989742888WikidataQ105583642 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 (30)
Turán numbers for hypergraph star forests ⋮ Large hypergraphs without tight cycles ⋮ The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs ⋮ The Turán number of disjoint copies of paths ⋮ The number of hypergraphs without linear cycles ⋮ Hypergraphs with no tight cycles ⋮ Turán problems and shadows. II: Trees ⋮ Turán numbers of complete 3-uniform Berge-hypergraphs ⋮ Extremal \(H\)-free planar graphs ⋮ 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 ⋮ On hypergraphs without loose cycles ⋮ The structure of large intersecting families ⋮ Extremal Results for Berge Hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ Turán problems and shadows. I: Paths and cycles ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ On extremal hypergraphs for forests of tight paths ⋮ Cycles of given lengths in hypergraphs ⋮ Relative Turán numbers for hypergraph cycles ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Extremal Theta-free planar graphs ⋮ Planar Turán numbers of short paths ⋮ Turán Problems and Shadows III: Expansions of Graphs ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ Hypergraph Turán numbers of vertex disjoint cycles
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
This page was built for publication: Hypergraph Turán numbers of linear cycles
