A new upper bound on extremal number of even cycles

DOI10.37236/9861zbMath1466.05100arXiv2009.04590OpenAlexW3175486074MaRDI QIDQ2034066

Zhiyang He

Publication date: 21 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.04590

zbMATH Keywords

Turán's problemBukh-Jiang's approach

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Extremal combinatorics (05D99)

Related Items (4)

On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles ⋮ Extremal results on feedback arc sets in digraphs ⋮ On the Turán Number of Generalized Theta Graphs ⋮ The spectral radius of graphs with no odd wheels

Cites Work

• Cycles of even length in graphs
• A note on the Turán function of even cycles
• A Bound on the Number of Edges in Graphs Without an Even Cycle
• A Note on Bipartite Graphs Without 2 k -Cycles
• On the structure of linear graphs

This page was built for publication: A new upper bound on extremal number of even cycles