par Dujmović, Vida V.;Joret, Gwenaël ;Micek, Piotr;Morin, Pat P.
Référence Journal of the London Mathematical Society, 114, 2, e70607
Publication Publié, 2026-08-01
Article révisé par les pairs
Résumé : We prove that there exist functions (Formula presented.) such that for all nonnegative integers (Formula presented.) and (Formula presented.), for every graph (Formula presented.), either (Formula presented.) contains (Formula presented.) cycles such that vertices of different cycles have distance greater than (Formula presented.) in (Formula presented.), or there exists a subset (Formula presented.) of vertices of (Formula presented.) with (Formula presented.) such that (Formula presented.) is a forest, where (Formula presented.) denotes the set of vertices of (Formula presented.) having distance at most (Formula presented.) from a vertex of (Formula presented.).