| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657042 | Journal of Combinatorial Theory, Series B | 2013 | 10 Pages |
Abstract
We prove an upper bound for the number of edges a C4-free graph on q2+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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
