The Turan number ex(n,{C>=k,F}) is determined up to an additive constant for every 2-connected F with p(F) at least floor((k-1)/2)+1; the even-k formula is n times the larger of (k-2)/2 and ex(k-1,F)/(k-2), plus O_k(1).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tur\'an numbers of cycles plus a general graph
The Turan number ex(n,{C>=k,F}) is determined up to an additive constant for every 2-connected F with p(F) at least floor((k-1)/2)+1; the even-k formula is n times the larger of (k-2)/2 and ex(k-1,F)/(k-2), plus O_k(1).