Ramsey's theorem and self-complementary graphs

V. Chvatal, P. Erdös, Z. Hedrlin

Research output: Contribution to journalArticle

8 Citations (Scopus)


It is proved that, given any positive integer k, there exists a self-complementary graph with more than 4·2 1 4k vertices which contains no complete subgraph with k+1 vertices. An application of this result to coding theory is mentioned.

Original languageEnglish
Pages (from-to)301-304
Number of pages4
JournalDiscrete Mathematics
Issue number4
Publication statusPublished - 1972

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Ramsey's theorem and self-complementary graphs'. Together they form a unique fingerprint.

  • Cite this