For a fixed finite collection of graphs $\mathcal{F}$, the $\mathcal{F}$-Minor-Free Deletion problem asks, given a graph $G$ and an integer $k$, whether there is a set $S\subseteq V(G)$ with $|S|\leq k$ such that $G-S$ contains no graph of $\mathcal{F}$ as a minor. This generalizes Vertex Cover, Feedback Vertex Set, an...
Jongseo Lee, Roohani Sharma, Sebastian Wiederrecht· 0 citations
The well-known Bermond-Thomassen conjecture states that every digraph of minimum out-degree at least $2k-1$ contains $k$ vertex-disjoint directed cycles. Despite being posed in 1981, this conjecture remains unresolved for all $k \ge 4$. We prove a relaxation of this conjecture: every digraph $D$ of minimum out-degree a...
S. Bessy, M. Muis, Jean-Sébastien Sereni et al.· 1 citation
A new local structure theorem for annotated graphs of bounded $\mathsf{depth}_2$ with a spanning analogue of the celebrated Vital Linkage Theorem and matching lower bounds showing that beyond bounded $\mathsf{depth}_2$ no irrelevant-vertex rule can exist, even on planar graphs.
D. Thilikos, Sebastian Wiederrecht· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.