VOOZH about

URL: https://www.erdosproblems.com/latex/569

⇱ Erdős Problems


👁 Logo
Forum Inbox Favourites Tags
More
Forum
Dual View Random Solved Random Open
Let $k\geq 1$. What is the best possible $c_k$ such that\[R(C_{2k+1},H)\leq c_k m\]for any graph $H$ on $m$ edges without isolated vertices?
This problem is #34 in Ramsey Theory in the graphs problem collection.
Back to the problem