Let $k \geq 1$ . What is the best possible $c_{k}$ such that $R (C_{2 k + 1}, H) \leq c_{k} m$ for any graph $H$ on $m$ edges without isolated vertices?

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

### The optimal linear coefficient is $2$

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

open