Upper bounds on the extremal number of the 4-cycle
FOS: Mathematics
Mathematics - Combinatorics
Combinatorics (math.CO)
0102 computer and information sciences
01 natural sciences
DOI:
10.48550/arxiv.2107.11601
Publication Date:
2023-02-17
AUTHORS (2)
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 .
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....