### Abstract

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 language | English |
---|---|

Pages (from-to) | 301-304 |

Number of pages | 4 |

Journal | Discrete Mathematics |

Volume | 3 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1972 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*3*(4), 301-304. https://doi.org/10.1016/0012-365X(72)90087-8

**Ramsey's theorem and self-complementary graphs.** / Chvatal, V.; Erdős, P.; Hedrlin, Z.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 3, no. 4, pp. 301-304. https://doi.org/10.1016/0012-365X(72)90087-8

}

TY - JOUR

T1 - Ramsey's theorem and self-complementary graphs

AU - Chvatal, V.

AU - Erdős, P.

AU - Hedrlin, Z.

PY - 1972

Y1 - 1972

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

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

UR - http://www.scopus.com/inward/record.url?scp=0013208516&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0013208516&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(72)90087-8

DO - 10.1016/0012-365X(72)90087-8

M3 - Article

AN - SCOPUS:0013208516

VL - 3

SP - 301

EP - 304

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 4

ER -