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

关于偶数圈的精确分解阈值

On the exact decomposition threshold for even cycles

Amelia Taylor

摘要:

一个图$G$有一个$C_k$ -分解,如果它的边集可以被划分成长度为$k$的圈.我们表明,如果$δ(G)\geq 2|G|/3-1$,那么$G$有$C_4$ -分解,如果$δ(G)\geq |G|/2$,那么$G$有$C_{2k}$ -分解,其中$k\in \mathbb{N}$和$k\geq 4$(我们假设$G$是大的,并满足必要的整除条件)。这些最小程度的界限是最好的可能性,并提供精确版本的渐近结果获得的巴伯,库恩,洛和Osthus。在这个过程中,我们得到这些结果的渐近版本时,$G$是二分的或满足一定的扩展性质。

英文摘要:

A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $δ(G)\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $δ(G)\geq |G|/2$, then $G$ has a $C_{2k}$-decomposition, where $k\in \mathbb{N}$ and $k\geq 4$ (we assume $G$ is large and satisfies necessary divisibility conditions). These minimum degree bounds are best possible and provide exact versions of asymptotic results obtained by Barber, Kühn, Lo and Osthus. In the process, we obtain asymptotic versions of these results when $G$ is bipartite or satisfies certain expansion properties.

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

↑