Geodesic
A new upper bound on extremal number of even cycles
Zhiyang He1
1Carnegie Mellon University
The electronic journal of combinatorics, Tome 28 (2021) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper, we prove $\mathrm{ex}(n, C_{2k})\le (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k}$. This improves on a result of Bukh and Jiang from 2017, thereby reducing the best known upper bound by a factor of $\sqrt{5\log k}$.
DOI : 10.37236/9861
Classification : 05C30, 05C35, 05C38, 05D99
Mots-clés : Turán's problem, Bukh-Jiang's approach

Zhiyang He  1

1 Carnegie Mellon University 
@article{10_37236_9861,
     author = {Zhiyang He},
     title = {A new upper bound on extremal number of even cycles},
     journal = {The electronic journal of combinatorics},
     year = {2021},
     volume = {28},
     number = {2},
     doi = {10.37236/9861},
     zbl = {1466.05100},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9861/}
}
TY  - JOUR
AU  - Zhiyang He
TI  - A new upper bound on extremal number of even cycles
JO  - The electronic journal of combinatorics
PY  - 2021
VL  - 28
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9861/
DO  - 10.37236/9861
ID  - 10_37236_9861
ER  - 
%0 Journal Article
%A Zhiyang He
%T A new upper bound on extremal number of even cycles
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/9861/
%R 10.37236/9861
%F 10_37236_9861
Zhiyang He. A new upper bound on extremal number of even cycles. The electronic journal of combinatorics, Tome 28 (2021) no. 2. doi: 10.37236/9861

Cité par Sources :