Graphs without quadrilaterals

Research output: Contribution to journalArticle

51 Citations (Scopus)


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).

Original languageEnglish
Pages (from-to)187-190
Number of pages4
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - Apr 1983

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Graphs without quadrilaterals'. Together they form a unique fingerprint.

  • Cite this