# Exact solution of the hypergraph Turán problem for k-uniform linear paths

@article{Fredi2014ExactSO,
title={Exact solution of the hypergraph Tur{\'a}n problem for k-uniform linear paths},
author={Zolt{\'a}n F{\"u}redi and Tao Jiang and Robert Seiver},
journal={Combinatorica},
year={2014},
volume={34},
pages={299-322}
}
• Published 5 August 2011
• Mathematics
• Combinatorica
A k-uniform linear path of length ℓ, denoted by ℙℓ(k), is a family of k-sets {F1,...,Fℓ such that |Fi ∩ Fi+1|=1 for each i and Fi ∩ Fbj = $\not 0$ whenever |i−j|>1. Given a k-uniform hypergraph H and a positive integer n, the k-uniform hypergraph Turán number of H, denoted by exk(n, H), is the maximum number of edges in a k-uniform hypergraph $\mathcal{F}$ on n vertices that does not contain H as a subhypergraph. With an intensive use of the delta-system method, we determine exk(n, Pℓ(k…
Hypergraph Turán numbers of linear cycles
• Mathematics
J. Comb. Theory, Ser. A
• 2014
Hypergraph Turán Numbers of Vertex Disjoint Cycles
• Mathematics
Acta Mathematicae Applicatae Sinica, English Series
• 2022
The Turán number of a k -uniform hypergraph H , denoted by ex k ( n ; H ), is the maximum number of edges in any k -uniform hypergraph F on n vertices which does not contain H as a subgraph. Let
Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• Mathematics
Combinatorics, Probability and Computing
• 2017
The results on linear Turán numbers of even cycles and the cycle-complete hypergraph Ramsey numbers are obtained and positive constants a = am,r and b = bm,r, depending only on m and r are shown.
Turán problems and shadows I: Paths and cycles
• Mathematics
J. Comb. Theory, Ser. A
• 2015
Turán Problems and Shadows III: Expansions of Graphs
• Mathematics
SIAM J. Discret. Math.
• 2015
This paper shows that this occurs when G is any bipartite graph with Turan number o(n ϕ ) where ϕ = 1+ √ 5 2 , and in particular this shows ex3(n, G + )= O(n 2 )w henG is the three-dimensional cube graph.
Turán problems and shadows II: Trees
• Mathematics
J. Comb. Theory, Ser. B
• 2017
The Junta Method for Hypergraphs and the Erd\H{o}s-Chv\'{a}tal Simplex Conjecture
• Mathematics
• 2017
Numerous problems in extremal hypergraph theory ask to determine the maximal size of a $k$-uniform hypergraph on $n$ vertices that does not contain an `enlarged' copy $H^+$ of a fixed hypergraph $H$.