Ramsey's theorem and self-complementary graphs
✍ Scribed by V. Chvatal; P. Erdös; Z. Hedrlin
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 349 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no __K__~5~, with 41 vertices and a self‐complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num
## Abstract The class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
## Abstract A simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111–112, 2001