Note on Enomoto and Ota's conjecture for short paths in large graphs

DOI10.1007/s00373-013-1351-7zbMath1306.05190OpenAlexW2024548810WikidataQ123139644 ScholiaQ123139644MaRDI QIDQ489313

Colton Magnant, Martin Hall, Hua Wang

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1351-7

zbMATH Keywords

regularity lemmadegree sumdisjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (2)

Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Blow-up lemma
• An asymptotic version of a conjecture by Enomoto and Ota
• Note on Hamilton Circuits
• An Ore-type Theorem for Perfect Packings in Graphs
• Partitions of a graph into paths with prescribed endvertices and lengths

This page was built for publication: Note on Enomoto and Ota's conjecture for short paths in large graphs