arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0707.2522math.CO
收藏

关于嵌入良可分图

On embedding well-separable graphs

Béla Csaba

摘要:

如果删除一个大小为$o(n)$的分隔符集,剩下的图将有大小至多为$o(n)$的分量,则称一个阶为$n$的简单图$H$是良好可分的。证明了有界度良分生成子图是容易嵌入的:对每个$γ>0$和正整数$Δ$,存在一个$n_0$,使得如果$n>n_0$,$Δ(H) \le Δ$对于阶为$n$的良分图$H$和$δ(G) \ge (1-{1 \over 2(χ(H)-1)} + γ)n$对于阶为$n$的简单图$G$,则$H \subset G$ .我们也将这个结果推广到了小带宽的图。

英文摘要:

Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o(n)$ the leftover will have components of size at most $o(n)$. We prove, that bounded degree well-separable spanning subgraphs are easy to embed: for every $γ>0$ and positive integer $Δ$ there exists an $n_0$ such that if $n>n_0$, $Δ(H) \le Δ$ for a well-separable graph $H$ of order $n$ and $δ(G) \ge (1-{1 \over 2(χ(H)-1)} + γ)n$ for a simple graph $G$ of order $n$, then $H \subset G$. We extend our result to graphs with small band-width, too.

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

↑