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

关于完美细分平铺

On perfect subdivision tilings

Hyunwoo Lee

AI总结:

本文研究图$H$的完美细分平铺问题,通过最小度条件$δ_{\mathrm{sub}}(n, H)$,对任意给定图$H$渐近确定了其完美细分平铺存在的最小度阈值。

摘要:

对于给定的图$H$,如果图$G$包含一组覆盖$G$所有顶点的顶点不相交的$H$的细分,则称图$G$具有完美的$H$-细分平铺。设$δ_{\mathrm{sub}}(n, H)$为最小的整数$k$,使得任意最小度至少为$k$的$n$顶点图$G$都具有完美的$H$-细分平铺。对于每个图$H$,我们渐近地确定了$δ_{\mathrm{sub}}(n, H)$的值。更准确地说,对于每个至少有一条边的图$H$,存在一个整数$\mathrm{hcf}_ξ(H)$和一个可由$H$的结构性质显式确定的常数$1 < ξ^*(H)\leq 2$,使得除非$\mathrm{hcf}_ξ(H) = 2$且$n$为奇数,否则$δ_{\mathrm{sub}}(n, H) = \left(1 - \frac{1}{ξ^*(H)} + o(1) \right)n$对所有$n$和$H$成立。当$\mathrm{hcf}_ξ(H) = 2$且$n$为奇数时,我们证明$δ_{\mathrm{sub}}(n, H) = \left(\frac{1}{2} + o(1) \right)n$。

英文摘要:

For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $δ_{\mathrm{sub}}(n, H)$ be the smallest integer $k$ such that any $n$-vertex graph $G$ with minimum degree at least $k$ has a perfect $H$-subdivision tiling. For every graph $H$, we asymptotically determined the value of $δ_{\mathrm{sub}}(n, H)$. More precisely, for every graph $H$ with at least one edge, there is an integer $\mathrm{hcf}_ξ(H)$ and a constant $1 < ξ^*(H)\leq 2$ that can be explicitly determined by structural properties of $H$ such that $δ_{\mathrm{sub}}(n, H) = \left(1 - \frac{1}{ξ^*(H)} + o(1) \right)n$ holds for all $n$ and $H$ unless $\mathrm{hcf}_ξ(H) = 2$ and $n$ is odd. When $\mathrm{hcf}_ξ(H) = 2$ and $n$ is odd, then we show that $δ_{\mathrm{sub}}(n, H) = \left(\frac{1}{2} + o(1) \right)n$.

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

↑