论文信息 - Ramsey's theorem and self-complementary graphs

Ramsey's theorem and self-complementary graphs

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

Vašek Chvátal | Paul Erdös | Z. Hedrlin

[1] P. Erdös. Some remarks on the theory of graphs , 1947 .

[2] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.

[3] M. Rosenfeld. Graphs with a large capacity , 1970 .

[4] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[5] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .

[6] J. G. Kalbfleisch. A uniqueness theorem for edge-chromatic graphs. , 1967 .

[7] Robert J. McEliece,et al. Ramsey bounds for graph products , 1971 .