Mathematical Sciences: Faculty Publications
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.
Recommended Citation
Hall, Martin, Colton Magnant, Hua Wang.
2014.
"Note on Enomoto and Ota’s Conjecture for Short Paths in Large Graphs."
Graphs and Combinatorics, 30 (6): 1463-1467.
doi: 10.1007/s00373-013-1351-7
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/220
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
