Connectivity, toughness, and hamiltonicity of simplicial polytopes

Source abstract

For every $d\ge4$, every prescribed connectivity $r\ge d$, and every $\varepsilon>0$, we construct a simplicial $d$-polytope whose graph has connectivity exactly $r$, is nontraceable, and has toughness less than $\varepsilon$. Thus the classical theorems of Whitney (1931) and Tutte (1956), which guarantee hamiltonicity under sufficiently high connectivity in dimension three, have no higher-dimensional counterpart. This answers a question posed by Bojan Mohar in 2001 on whether sufficiently high connectivity guarantees hamiltonicity of $4$-polytopal graphs and the connectivity questions raised by Ikegami, Maezawa, and Zamfirescu in 2021. For fixed $d\ge4$, $r\ge d$, and integer $k\ge2$, the examples can be chosen to have no closed spanning walk with at most $k$ visits per vertex, no spanning tree with degrees at most $k$, and nontraceable prisms. For fixed $d$ and $r$, we obtain graphs on $n$ vertices whose longest paths and cycles contain $O(\sqrt n)$ vertices. Consequently, the family of simplicial $d$-polytopes with connectivity exactly $r$ has Grünbaum--Walther shortness coefficient zero and shortness exponent at most $1/2$.