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

给定密度的大图中的多个Hamilton子集

Many Hamiltonian subsets in large graphs with given density

Stijn Cambie, Jun Gao, Hong Liu

摘要:

一个图的顶点集是一个哈密尔顿子集,如果它导出一个包含哈密顿圈的子图。Kim,Liu,Sharifzadeh和Staden证明了在所有具有最小度$d$的图中,$K_{d+1}$使Hamilton子集的个数最小.我们证明了一个接近最优的下界,也需要考虑到图的顺序和结构。对于许多自然图类,它提供了一个更好的界限比极值($\approx 2^{d+1}$)。其中,我们的界意味着具有最小度$d$的$n$ -顶点$C_4$ -free图至少包含$n2^{d^{2-o(1)}}$ Hamilton子集.

英文摘要:

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of Hamiltonian subsets. We prove a near optimal lower bound that takes also the order and the structure of a graph into account. For many natural graph classes, it provides a much better bound than the extremal one ($\approx 2^{d+1}$). Among others, our bound implies that an $n$-vertex $C_4$-free graphs with minimum degree $d$ contains at least $n2^{d^{2-o(1)}}$ Hamiltonian subsets.

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

↑