Simple proof of the existence of restricted ramsey graphs by means of a partite construction |
| |
Authors: | Jaroslav Nešetřil Vojtěch Rödl |
| |
Institution: | (1) KZAA MFF KU, Charles University, Sokolovská 83, 18 600 Praha 8, Czechoslovakia;(2) KM FJFI CVUT, Czech Technical Univ., Husova 5, 11 000 Praha 1, Czechoslovakia |
| |
Abstract: | By means of a partite construction we present a short proof of the Galvin Ramsey property of the class of all finite graphs
and of its strengthening proved in 5]. We also establish a generalization of those results. Further we show that for every
positive integerm there exists a graphH which is Ramsey forK
m and does not contain two copies ofK
m with more than two vertices in common. |
| |
Keywords: | 05 C 55 |
本文献已被 SpringerLink 等数据库收录! |
|