2000 character limit reached
Sublinear Longest Path Transversals (2005.02716v2)
Published 6 May 2020 in math.CO and cs.DM
Abstract: We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of constant size. The same technique allows us to show that $2$-connected graphs admit sublinear longest cycle transversals.