Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Distel, Marc, Giocanti, Ugo, Hodor, Jędrzej, Legrand-Duchesne, Clément, Micek, Piotr
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2601.18439
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Inhaltsangabe:
  • We prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$, for every graph $G$ and every subset $A$ of the vertices of $G$, either $G$ contains $k$ $A$-paths such that vertices of different $A$-paths are at distance at least $d$ in $G$, or there exists a set $X$ of the vertices of $G$ with $|X|\leq f(k)$ such that every $A$-path in $G$ contains a vertex of $B_G(X,g(k,d))$.