Extremal Graphs Without 4-Cycles
Combinatorics
2012-01-25 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1201.4912,
title = {Extremal Graphs Without 4-Cycles},
author = {Frank A. Firke and Peter M. Kosek and Evan D. Nash and Jason Williford},
journal= {arXiv preprint arXiv:1201.4912},
year = {2012}
}
Comments
9 pages