Complete graph immersions and minimum degree

An immersion of a graph H in another graph G is a one-to-one mapping phi:V(H)->V(G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P_{uv} corresponding to the edge uv has endpoints phi(u) and phi(v). The immersion is strong if the paths P_{uv} are interna...

Full description

Saved in:
Bibliographic Details
Main Authors Dvořák, Zdeněk, Yepremyan, Liana
Format Journal Article
LanguageEnglish
Published 01.12.2015
Subjects
Mathematics - Combinatorics
Online AccessGet full text

Cover

More Information
Summary:An immersion of a graph H in another graph G is a one-to-one mapping phi:V(H)->V(G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P_{uv} corresponding to the edge uv has endpoints phi(u) and phi(v). The immersion is strong if the paths P_{uv} are internally disjoint from phi(V(H)). We prove that every simple graph of minimum degree at least 11t+7 contains a strong immersion of the complete graph K_t. This improves on previously known bound of minimum degree at least 200t obtained by DeVos et al.
DOI:10.48550/arxiv.1512.00513