Sublinear Longest Path Transversals
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2020
- DOI:
- 10.48550/arXiv.2005.02716
- arXiv:
- arXiv:2005.02716
- Bibcode:
- 2020arXiv200502716L
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Discrete Mathematics
- E-Print:
- A previous version of this arXiv post has been split into two parts