Dirac's Theorem for Graphs of Bounded Bandwidth

  • Alberto Espuny Díaz
  • Pranshu Gupta
  • Domenico Mergoni Cecchelli
  • Olaf Parczyk
  • Amedeo Sgueglia
DOI: https://doi.org/10.37236/13474

Abstract

We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and has applications in the random geometric graph model. Our proof provides a greedy algorithm for constructing such structures.

Published
2026-01-23
How to Cite
Espuny Díaz, A., Gupta, P., Mergoni Cecchelli, D., Parczyk, O., & Sgueglia, A. (2026). Dirac’s Theorem for Graphs of Bounded Bandwidth. The Electronic Journal of Combinatorics, 33(1), P1.21. https://doi.org/10.37236/13474
Issue
Volume 33, Issue 1 ( 2026)
Article Number
P1.21