Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
From MaRDI portal
Publication:397075
DOI10.1007/s00493-014-2838-4zbMath1324.05192arXiv1108.1247OpenAlexW2154774722MaRDI QIDQ397075
Robert Seiver, Tao Jiang, Zoltan Fueredi
Publication date: 14 August 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.1247
Related Items (32)
Turán numbers for hypergraph star forests ⋮ Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Turán numbers for 3-uniform linear paths of length 3 ⋮ Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three ⋮ The Turán number of disjoint copies of paths ⋮ 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 ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Hypergraph Turán numbers of linear cycles ⋮ Extremal Results for Berge Hypergraphs ⋮ The multipartite Ramsey number for the 3-path of length three ⋮ Non-trivial \(d\)-wise intersecting families ⋮ 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 ⋮ Linear Turán numbers of acyclic triple systems ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three ⋮ One more Turán number and Ramsey number for the loose 3-uniform path of length three ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ On extremal hypergraphs for forests of tight paths ⋮ Linear trees in uniform hypergraphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Minimum degree of 3-graphs without long linear paths ⋮ Extremal Theta-free planar graphs ⋮ Planar Turán numbers of short paths ⋮ Turán Problems and Shadows III: Expansions of Graphs ⋮ Hypergraph Turán numbers of vertex disjoint cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- On finite set-systems whose every intersection is a kernel of a star
- Asymptotic solution for a new class of forbidden r-graphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- On a packing and covering problem
- Exact solution of some Turán-type problems
- Stability theorems for cancellative hypergraphs
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Minimal paths and cycles in set systems
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- A hypergraph extension of Turán's theorem
- Hypergraph Extensions of the Erdős-Gallai Theorem
- Set Systems without a Strong Simplex
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
- On families of finite sets no two of which intersect in a singleton
- Intersection Properties of Systems of Finite Sets
- Hamiltonian chains in hypergraphs
- Set Systems with No Singleton Intersection
- On coloring graphs to maximize the proportion of multicolored k-edges
This page was built for publication: Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
