Cycle--clique Ramsey numbersResearch Paper
The Ramsey number is the least such that every red–blue colouring of the edges of contains a red copy of or a blue copy of . For a cycle against a clique there is a simple lower-bound construction: take disjoint red cliques of order with all edges between them blue. It has vertices, no red (each red component…