arXiv Analytics

Sign in

arXiv:1201.4912 [math.CO]AbstractReferencesReviewsResources

Extremal Graphs Without 4-Cycles

Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford

Published 2012-01-24Version 1

We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.

Comments: 9 pages
Categories: math.CO
Subjects: 05C35, 51E15
Related articles: Most relevant | Search more
arXiv:1501.03129 [math.CO] (Published 2015-01-13)
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
arXiv:1111.7029 [math.CO] (Published 2011-11-30)
Extremal graphs for clique-paths
arXiv:2009.00222 [math.CO] (Published 2020-09-01)
Upper bounds for the $MD$-numbers and characterization of extremal graphs

Links

Toolbox