Ramsey theory

../

L17_rainbow_odd_cycle_threshold/: For every fixed k at least 3, the fewest colors on some n-vertex graph with exactly one edge more than the Turán number that make every cycle of length 2k+1 rainbow is n squared over eight plus little o of n squared, answering Problem 809.

---

This category collects native claims in Ramsey theory. Each claim states its exact conclusion and current proof obligations; a claim's presence here is not acceptance or a change to a catalog problem's status. See the claim ledger for the generated cross-claim view.