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 
66 Citations

Figures and Topics from this paper

A Note on Odd Cycle-Complete Graph Ramsey Numbers
  • B. Sudakov
  • 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
  • H. Bielak
  • 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
  • 2
All cycle-complete graph Ramsey numbers r(Cm, K6)
  • 9
  • PDF
The Cycle-Complete Graph Ramsey Number r(C5, K7)
  • I. Schiermeyer
  • Mathematics, Computer Science
  • Discuss. Math. Graph Theory
  • 2005
  • 8
Generalised Ramsey numbers and Bruhat order on involutions
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 13 REFERENCES
Cycles of even length in graphs
  • 336
  • PDF
Generalized Ramsey theory for multiple colors
  • 31
  • PDF
Asymptotic lower bounds for Ramsey functions
  • J. Spencer
  • Computer Science, Mathematics
  • Discret. Math.
  • 1977
  • 230
Ramsey Numbers for Cycles in Graphs
  • 144
  • PDF
Graph Theory and Probability
  • 230
  • PDF
Graphs and Hypergraphs
  • 738
  • PDF
Probabilistic Methods in Combinatorics
  • 535
  • PDF
Probabilistic Methods in Corn bin a tones
  • Academic, New York
  • 1974
Introduction to the theory of graphs
  • 196
...
1
2
...