A Star-Comb Lemma for Finite Digraphs
The Electronic Journal of Combinatorics · 07.08.2026 · 33 (3)
DOI: 10.37236/13112 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 07.08.2026. Verfasst von Florian Reich.
Abstract (Originalsprache)
It is well-known that for every set $U$ of vertices in a connected graph $G$ there is either a subdivided star in $G$ with a large number of leaves in $U$, or a comb in $G$ with a large number of teeth in $U$.In this paper we extend this property to directed graphs. More precisely, we prove that for every $n \in \mathbb{N}$ and every sufficiently large set $U$ of vertices in a strongly connected directed graph $D$, there exists a strongly connected butterfly minor of $D$ with $n$ teeth in $U$ that is either 'shaped' by a star or 'shaped' by a comb.
Zitieren
APA
Reich, F. (2026). A Star-Comb Lemma for Finite Digraphs. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/13112
Vancouver
Reich F. A Star-Comb Lemma for Finite Digraphs. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/13112
BibTeX
@article{Reich2026,
author = {Reich, Florian},
title = {A Star-Comb Lemma for Finite Digraphs},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {3},
doi = {10.37236/13112}
}
EUVIMED