Covering the Edges of a Connected Graph by Paths

We prove that every connected graph onnvertices can be covered by at mostn/2+O(n3/4) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.