The Ramsey property for graphs with forbidden complete subgraphs
✍ Scribed by Jaroslav Nešetřil; Vojtěch Rödl
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 306 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the
The Ramsey numbers M,,, n,P,, ..., n,P,), p > 2, are calculated. ## 1. Introduction One class of generalized Ramsey numbers that are known exactly are those for the graphs nP2 which consist of n disjoint paths of length 2; E. J. Cockayne and the author proved in 111 that d r(nlp2, ..., n d P 2 ) =