Title

Note on Enomoto and Ota’s Conjecture for Short Paths in Large Graphs

Document Type

Article

Publication Date

11-2014

Publication Title

Graphs and Combinatorics

DOI

10.1007/s00373-013-1351-7

ISSN

1435-5914

Abstract

With sufficient minimum degree sum, Enomoto and Ota conjectured that for any selected set of vertices, there exists a spanning collection of disjoint paths, each starting at one of the selected vertices and each having a prescribed length. Using the Regularity Lemma, we prove that this claim holds without the spanning assumption if the vertex set of the host graph is sufficiently large.

Share

COinS