The Extremal Number of Cycles with All Diagonals

Author:

Bradač Domagoj1,Methuku Abhishek1,Sudakov Benny1

Affiliation:

1. Department of Mathematics , ETH, Zürich, Switzerland

Abstract

Abstract In 1975, Erd̋s asked the following question: What is the maximum number of edges that an $n$-vertex graph can have without containing a cycle with all diagonals? Erd̋s observed that the upper bound $O(n^{5/3})$ holds since the complete bipartite graph $K_{3,3}$ can be viewed as a cycle of length six with all diagonals. In this paper, we resolve this old problem. We prove that there exists a constant $C$ such that every $n$-vertex graph with at least $Cn^{3/2}$ edges contains a cycle with all diagonals. Since any cycle with all diagonals contains cycles of length four, this bound is best possible using well-known constructions of graphs without four-cycles based on finite geometry. Among other ideas, our proof involves a novel lemma about finding an almost-spanning robust expander, which might be of independent interest.

Publisher

Oxford University Press (OUP)

Reference41 articles.

1. Norm-graphs: variations and applications;Alon;J. Comb. Theory Ser. B,1999

2. Nested cycles in graphs;Bollobás,1978

3. Cycles of even length in graphs;Bondy;J. Comb. Theory Ser. B,1974

4. The Turán number of the grid;Bradač;Bull. Lond. Math. Soc.,2023

5. On graphs that do not contain a Thomsen graph;Brown;Can. Math. Bull.,1966

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Extremal graphs for the odd prism;Discrete Mathematics;2025-01

2. Sublinear Expanders and Their Applications;Surveys in Combinatorics 2024;2024-06-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3