A new upper bound on extremal number of even cycles (Q2034066): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3175486074 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2009.04590 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles of even length in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Bound on the Number of Edges in Graphs Without an Even Cycle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of linear graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on Bipartite Graphs Without 2 k -Cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the Turán function of even cycles / rank | |||
Normal rank | |||
Latest revision as of 00:32, 26 July 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
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
