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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics