Papers
Topics
Authors
Recent
Search
2000 character limit reached

Local modifications in planar hypohamiltonian graphs

Published 15 Oct 2026 in math.CO | (2610.21210v1)

Abstract: We prove that for n≥36n \geq 36 there exists a planar hypohamiltonian graph of order nn. As a corollary, we prove that for n≥33n \geq 33 there exists an almost hypohamiltonian planar graph of order nn. Further, we exhibit over 100 planar hypohamiltonian graphs of order less than 40, including new graphs of orders 36, 37, 38, and 39. The proof utilizes three local modifications that alter a graph GG by removing a subgraph HH and replacing it with $H'$ to form a new graph $G'$: a plus two modification, a plus three modification, and Thomassen's iterable plus four modification. The plus two modification preserves hypohamiltonicity in general, and the plus three modification preserves hypohamiltonicity in our cases of interest. This establishes the main result beginning with Tsai's order 34 examples. Further, we conjecture that among planar hypohamiltonian graphs, Tsai's 34 vertex examples are the smallest order. The conjecture is based on previous results, constraints on the degree modulo 3, and experimentation with planar graphs consisting entirely of 4-gons and 5-gons.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.