Density of Traceable Graphs
Michal Dvořák, Dušan Knop, Michal Opler, Jan Pokorný, Ondřej Suchý, Krisztina Szilágyi
Published: 2025/6/27
Abstract
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of bounded neighborhood diversity, bounded size of maximum induced matching or bounded cluster vertex deletion number; - n log n for the class of cographs or, more generaly, bounded modular-width, and for the class of bounded distance to cograph; and - sligthly superlinear for the class of bounded shrub-depth.