A Note on Odd Cycle-Complete Graph Ramsey Numbers

  • Benny Sudakov
DOI: https://doi.org/10.37236/1662

Abstract

The Ramsey number $r(C_l, K_n)$ is the smallest positive integer $m$ such that every graph of order $m$ contains either cycle of length $l$ or a set of $n$ independent vertices. In this short note we slightly improve the best known upper bound on $r(C_l, K_n)$ for odd $l$.

Published
2001-12-04
Issue
Volume 9 (2002)
Article Number
N1