Let f(n) denote the maximum number of edges of a graph on n vertices not containing a circuit of length 4. It is well known that f(n) ∼ 1 2n n. The old conjecture f(q2 + q + 1) = 1 2q(q + 1)2 is proved for infinitely many q (whenever q = 2k).
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics