Indexed metadata
A Note on Odd Cycle-Complete Graph Ramsey Numbers
Benny Sudakov
Source abstract
The Ramsey number is the smallest positive integer such that every graph of order contains either cycle of length or a set of independent vertices. In this short note we slightly improve the best known upper bound on for odd .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.