A minimum degree condition forcing complete graph immersion
- 243 Downloads
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 uv corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths P 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 t . For dense graphs one can say even more. If the graph has order n and has 2cn 2 edges, then there is a strong immersion of the complete graph on at least c 2 n vertices in G in which each path P 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 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 t (Lescure and Meyniel , DeVos et al. ). We provide a general class of examples showing that this does not hold when t is large.
Mathematics Subject Classification (2000)05C35 05C83
Unable to display preview. Download preview PDF.
- F. N. Abu-Khzam and M. A. Langston: Graph coloring and the immersion order, preprint.Google Scholar
- P. Erdős: Problems and results in graph theory and combinatorial analysis, in: Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977), Academic Press, New York, 1979, 153–163.Google Scholar
- J. Komlós, E. Szemerédi: Topological cliques in graphs. II, Combin. Probab. Comput. 5 (1996), 79–90.Google Scholar
- F. Lescure, H. Meyniel: On a problem upon configurations contained in graphs with given chromatic number, Graph theory in memory of G. A. Dirac (Sandbjerg, 1985), 325–331, Ann. Discrete Math. 41, North-Holland, Amsterdam, 1989.Google Scholar
- P. Seymour: personal communication.Google Scholar