Paperlane

no. 17 · Wednesday 18 November 2026

An infinite family of bipartite hypotraceable graphs

Jorik Jooken

math.CO · 12 pp

Abstract

A graph is hypotraceable if it has no Hamiltonian path but every vertex-deleted subgraph does. In 1978, Grötschel asked whether a bipartite hypotraceable graph exists. We resolve this long-standing question in a strong sense by proving that such graphs exist for every sufficiently large even order. Moreover, we show that bipartite hypotraceable graphs can have $\left(1/4+o(1)\right)n^2$ edges, asymptotically attaining the maximum possible number of edges of a bipartite graph, and that there are at least $2^{(1/4+o(1))n^2}$ nonisomorphic examples of order $n$, as $n$ tends to infinity through even integers. Finally, we prove that every bipartite graph occurs as an induced subgraph of a bipartite hypotraceable graph.

comments
12 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.23018 ↗