Abstract
We show that, for each fixed k, an n-vertex graph not containing a cycle of length 2k has at most $80\sqrt{k\log k}\cdot n^{1+1/k}+O(n)$ edges.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Counting triangles in graphs without vertex disjoint odd cycles;Discrete Mathematics;2024-07
2. Extremal numbers of hypergraph suspensions of even cycles;European Journal of Combinatorics;2024-05
3. Linear cycles of consecutive lengths;Journal of Combinatorial Theory, Series B;2023-11
4. The Ramsey number of a long even cycle versus a star;Journal of Combinatorial Theory, Series B;2023-09
5. Tropical Group Testing;IEEE Transactions on Information Theory;2023-09