On cycle - Complete graph ramsey numbers
@article{Erds1978OnC, title={On cycle - Complete graph ramsey numbers}, author={P. Erd{\"o}s and R. Faudree and C. Rousseau and R. Schelp}, journal={J. Graph Theory}, year={1978}, volume={2}, pages={53-64} }
A new upper bound is given for the cycle-complete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices
Figures and Topics from this paper
66 Citations
A Note on Odd Cycle-Complete Graph Ramsey Numbers
- Mathematics, Computer Science
- Electron. J. Comb.
- 2002
- 30
- PDF
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
- Mathematics, Computer Science
- Discuss. Math. Graph Theory
- 1999
- 7
- PDF
The Ramsey number for a cycle of length six versus a clique of order eight
- Computer Science, Mathematics
- Discret. Appl. Math.
- 2009
- 2
The Cycle-Complete Graph Ramsey Number r(C5, K7)
- Mathematics, Computer Science
- Discuss. Math. Graph Theory
- 2005
- 8
References
SHOWING 1-10 OF 13 REFERENCES
Probabilistic Methods in Corn bin a tones
- Academic, New York
- 1974