Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs

Authors

Emily C. Chizmar, Georgia SouthernFollow
Colton Magnant, Georgia Southern UniversityFollow
Pouria Salehi Nowbandegani, Vanderbilt UniversityFollow

Document Type

Article

Publication Date

5-2016

Publication Title

Graphs and Combinatorics

DOI

10.1007/s00373-015-1631-5

ISSN

1435-5914

Abstract

We prove a sharp connectivity and degree sum condition for the existence of a subdivision of a multigraph in which some of the vertices are specified and the distance between each pair of vertices in the subdivision is prescribed (within one). Our proof makes use of the powerful Regularity Lemma in an easy way that highlights the extreme versatility of the lemma.

Recommended Citation

Chizmar, Emily C., Colton Magnant, Pouria Salehi Nowbandegani. 2016. "Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs." Graphs and Combinatorics, 32 (3): 881-886. doi: 10.1007/s00373-015-1631-5
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/585