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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn, vol. 173. Springer, Heidelberg (2010)
Enomoto H., Ota K.: Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34(2), 163–169 (2000)
Komlós J., Sárközy G.N., Szemerédi E.: Blow-up lemma. Combinatorica 17(1), 109–123 (1997)
Kühn D., Osthus D., Treglown A.: An Ore-type theorem for perfect packings in graphs. SIAM J. Discrete Math. 23(3), 1335–1355 (2009)
Magnant C., Martin D.M.: An asymptotic version of a conjecture by Enomoto and Ota. J. Graph Theory 64(1), 37–51 (2010)
Menger K.: Über reguläre Baumkurven. Math. Ann. 96(1), 572–582 (1927)
Ore O.: Note on Hamilton circuits. Am. Math. Monthly 67, 55 (1960)
Szemerédi, E.: Regular partitions of graphs. In: Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, vol. 260, pp. 399–401. CNRS, Paris (1978)
Author information
Authors and Affiliations
Corresponding author
Additional information
C. Magnant was supported by Georgia Southern Faculty Research Committee Research Competition Award. H. Wang’s work was partially supported by a grant from the Simons Foundation (#245307).
Rights and permissions
About this article
Cite this article
Hall, M., Magnant, C. & Wang, H. Note on Enomoto and Ota’s Conjecture for Short Paths in Large Graphs. Graphs and Combinatorics 30, 1463–1467 (2014). https://doi.org/10.1007/s00373-013-1351-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-013-1351-7