当前位置: X-MOL 学术Eur. J. Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
4-connected polyhedra have at least a linear number of hamiltonian cycles
European Journal of Combinatorics ( IF 1.0 ) Pub Date : 2021-07-06 , DOI: 10.1016/j.ejc.2021.103395
Gunnar Brinkmann 1 , Nico Van Cleemput 1
Affiliation  

Although polyhedra can have much fewer edges than triangulations, many results about hamiltonicity proven for triangulations also hold for polyhedra. The most famous of these results is surely Whitney’s result from 1931 that 4-connected triangulations are hamiltonian, which was 25 years later generalised to 4-connected polyhedra by Tutte. Nevertheless the only known bounds for the number of hamiltonian cycles in 4-connected polyhedra are constant, though for triangulations a lower bound of |V|(log2|V|) was already proven in 1979 and improved to a linear bound in 2018. In this article we prove linear lower bounds for 4-connected polyhedra and polyhedra with at most one 3-cut and sufficiently many edges.



中文翻译:

4-连通多面体至少具有线性数量的哈密顿循环

尽管多面体可以比三角剖分具有更少的边,但许多关于三角剖分证明的半调性结果也适用于多面体。这些结果中最著名的肯定是惠特尼 1931 年的结果,即 4 连通三角剖分是汉密尔顿式的,25 年后,图特将其推广为 4 连通多面体。然而,4 连通多面体中哈密顿圈数的唯一已知界限是恒定的,尽管对于三角剖分,下界为||(日志2||) 已经在 1979 年得到证明,并在 2018 年改进为线性边界。 在本文中,我们证明了 4 连通多面体和最多具有一个 3 切割和足够多边的多面体的线性下界。

更新日期:2021-07-06
down
wechat
bug