A Note on Cliques and Independent Sets

Roger C. Entringer, Wayne Goddard, Michael A. Henning

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)


For integers m, n ≥ 2, let f(m,n) be the minimum order of a graph where every vertex belongs to both a clique of cardinality m and an independent set of cardinality n. We show that f(m, n) = [(√m - 1 + √n - 1)2].

Original languageEnglish
Pages (from-to)21-23
Number of pages3
JournalJournal of Graph Theory
Issue number1
Publication statusPublished - Jan 1997
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'A Note on Cliques and Independent Sets'. Together they form a unique fingerprint.

Cite this