arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1101.2630math.CO
收藏

强迫完全图浸入的最小度条件

Minimum degree condition forcing complete graph immersion

Matt DeVos, Zdeněk Dvořák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide

摘要:

图$H$到图$G$中的浸入是一对一映射$f:V(H) \to V(G)$和$G$中的边不相交路径的集合,$H$的每个边一个,使得对应于边$uv$的路径$P_{uv}$具有端点$f(u)$和$f(v)$。如果路径$P_{uv}$与$f(V(H))$在内部不相交,则浸入是强的。证明了对每一个正整数$t$,每一个最小度至少为$200t$的简单图都包含完全图$K_t$的一个强浸入.对于稠密图,我们可以说得更多。如果图有序$n$且有$2cn^2$边,则存在完全图在$G$中的至少$c^2 n$顶点上的强浸入,其中每条路径$P_{uv}$的长度为2。作为这些结果的应用,我们解决了Paul Seymour提出的一个问题,证明了每一个平均度为$d$的简单图的线图都有一个阶至少为$cd^{3/2}$的团子式,其中$c>0$是一个绝对常数.对于$t$,$1\le t\le 7$的小值,每个最小度至少为$t-1$的简单图包含$K_t$的浸入(Lescure和Meyniel,DeVos等人)。我们提供了一个一般类的例子表明,这并不成立时,$t$是大的。

英文摘要:

An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \to 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 $t$, 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\le t\le 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑