Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A minimum degree condition forcing complete graph immersion

A minimum degree condition forcing complete graph immersion

Thumbnail Image
Download
Name

Fox_A minimum.pdf

Size

200.46 KB

Format

Adobe PDF

Checksum (MD5)

c53b5110870d103eda10ece5dc3ecbc3

Author(s)
Devos, Matt
•
Fox, Jacob
•
McDonald, Jessica
•
Mohar, Bojan
•
Scheide, Diego
•
Dvorak, Zdenek
Date Issued
January 2014
Journal
Combinatorica
Publisher
Springer-Verlag
Citation
Devos, Matt, Zdenek Dvorak, Jacob Fox, Jessica McDonald, Bojan Mohar, and Diego Scheide. “A Minimum Degree Condition Forcing Complete Graph Immersion.” Combinatorica 34, no. 3 (February 8, 2014): 279–298.
Version
Original manuscript
Abstract
An immersion of a graph H into a graph G is a one-to-one mapping f: V (H) → V (G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P [subscript uv] corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths P [subscript uv] are internally disjoint from f(V (H)). It is proved that for every positive integer Ht, every simple graph of minimum degree at least 200t contains a strong immersion of the complete graph K [subscript t]. For dense graphs one can say even more. If the graph has order n and has 2cn [superscript 2] edges, then there is a strong immersion of the complete graph on at least c [superscript 2] n vertices in G in which each path P [subscript uv] is of length 2. As an application of these results, we resolve a problem raised by Paul Seymour by proving that the line graph of every simple graph with average degree d has a clique minor of order at least cd [superscript 3/2], where c>0 is an absolute constant. For small values of t, 1≤t≤7, every simple graph of minimum degree at least t−1 contains an immersion of K [subscript t] (Lescure and Meyniel [13], DeVos et al. [6]). We provide a general class of examples showing that this does not hold when t is large.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/92854
DOI of Published Version
https://doi.org/10.1007/s00493-014-2806-z
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.