Upper bounds on the extremal number of the 4‐cycle-Reference-Cited by-同舟云学术

Upper bounds on the extremal number of the 4‐cycle

Published:2023-02-17 Issue:4 Volume:55 Page:1655-1667
ISSN:0024-6093
Container-title:Bulletin of the London Mathematical Society
language:en
Short-container-title:Bulletin of London Math Soc

Author:

Ma Jie¹,Yang Tianchi²

Affiliation:

1. School of Mathematical Sciences University of Science and Technology of China Hefei Anhui China

2. Department of Mathematics National University of Singapore Singapore Singapore

Abstract

AbstractWe obtain some new upper bounds on the maximum number of edges in ‐vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on for a broad range of integers as well as a disproof of a conjecture of Erdős from 1970s which asserts that .

Funder

National Natural Science Foundation of China

National University of Singapore

Publisher

Wiley

Subject

General Mathematics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1112/blms.12810

Reference13 articles.

1. On Graphs that do not Contain a Thomsen Graph

2. The Zarankiewicz problem, cages, and geometries;Damásdi G.;Ann. Univ. Sci. Budapest. Eötvös Sect. Math.,2013

3. On sequences of integers no one of which divides the product of two others and some related problems;Erdős P.;Izv. Naustno‐Issl. Inst. Mat. i Meh. Tomsk,1938

4. P.Erdős Problems and results in combinatorial analysis Colloquio Internazionale sulle Teorie Combinatorie (Rome 1973) Tomo II Atti dei Convegni Lincei No.17 Accad. Naz. Lincei Rome 1976 pp.3–17.

5. P.Erdős Some extremal problems on families of graphs and related problems Combinatorial Mathematics (Proc. Internat. Conf. Combinatorial Theory Australian Nat. Univ. Canberra 1977) Lecture Notes in Mathematics vol.686.Springer Berlin 1978 pp.13–21.