Complete graph immersions and minimum degree

Complete graph immersions and minimum degree An immersion of a graph H in another graph G is a one‐to‐one mapping ϕ:V(H)→V(G) and a collection of edge‐disjoint paths in G, one for each edge of H, such that the path Puv corresponding to the edge uv has endpoints ϕ(u) and ϕ(v). The immersion is strong if the paths Puv are internally disjoint from ϕ(V(H)). We prove that every simple graph of minimum degree at least 11t+7 contains a strong immersion of the complete graph Kt. This improves on previously known bound of minimum degree at least 200t obtained by DeVos et al. Our result supports a conjecture of Lescure and Meyniel (also independently proposed by Abu‐Khzam and Langston), which is the analogue of famous Hadwiger’s conjecture for immersions and says that every graph without a Kt‐immersion is (t−1)‐colorable. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Graph Theory Wiley

Complete graph immersions and minimum degree

Loading next page...
 
/lp/wiley/complete-graph-immersions-and-minimum-degree-6ktA10S8Jd
Publisher
Wiley
Copyright
Copyright © 2018 Wiley Periodicals, Inc.
ISSN
0364-9024
eISSN
1097-0118
D.O.I.
10.1002/jgt.22206
Publisher site
See Article on Publisher Site

Abstract

An immersion of a graph H in another graph G is a one‐to‐one mapping ϕ:V(H)→V(G) and a collection of edge‐disjoint paths in G, one for each edge of H, such that the path Puv corresponding to the edge uv has endpoints ϕ(u) and ϕ(v). The immersion is strong if the paths Puv are internally disjoint from ϕ(V(H)). We prove that every simple graph of minimum degree at least 11t+7 contains a strong immersion of the complete graph Kt. This improves on previously known bound of minimum degree at least 200t obtained by DeVos et al. Our result supports a conjecture of Lescure and Meyniel (also independently proposed by Abu‐Khzam and Langston), which is the analogue of famous Hadwiger’s conjecture for immersions and says that every graph without a Kt‐immersion is (t−1)‐colorable.

Journal

Journal of Graph TheoryWiley

Published: Jan 1, 2018

Keywords: ;

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off