A new upper bound on extremal number of even cycles (Q2034066): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:38, 5 March 2024

scientific article
Language Label Description Also known as
English
A new upper bound on extremal number of even cycles
scientific article

    Statements

    A new upper bound on extremal number of even cycles (English)
    0 references
    0 references
    21 June 2021
    0 references
    Summary: In this paper, we prove \(\text{ex}(n, C_{2k})\leqslant (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k} \). This improves on a result of \textit{B. Bukh} and \textit{Z. Jiang} [Comb. Probab. Comput. 26, No. 1, 1--15 (2017; Zbl 1371.05138)], thereby reducing the best known upper bound by a factor of \(\sqrt{5\log k} \).
    0 references
    Turán's problem
    0 references
    Bukh-Jiang's approach
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references