A note on the Ramsey-multiplicity of the circuit
✍ Scribed by V. Rosta; L. Surányi
- Book ID
- 105437138
- Publisher
- Springer Netherlands
- Year
- 1976
- Tongue
- English
- Weight
- 217 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In 1929, Ramsey proved a theorem guaranteeing that if G1, G,, . . . , Gk are graphs, then there exists an integer r so that if the edges of EC, are colored in any fashion with k colors a monochromatic G\* in color i exists for some i Harary and Prins suggested the problem of deciding the minimum num
A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t