A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
On vertex-disjoint paths in regular graphs
2018
unpublished
Preserved Fulltext
Let c ∈ (0, 1] be a real number and let n be a sufficiently large integer. We prove that every n-vertex cn-regular graph G contains a collection of 1/c paths whose union covers all but at most o(n) vertices of G.
fatcat:5geqrwjpwrevln6ol5ka47waby