2000 character limit reached
Directed cycles have the edge-Erd\H os-Pósa property
Published 14 Feb 2018 in math.CO | (1802.05026v1)
Abstract: In this short note we prove that for every $k\in \mathbb{N}$ there is a $t_k\in\mathbb{N}$ such that for every digraph $G$ there are either $k$ edge-disjoint directed cycles in $G$ or a set $X$ of at most $t_k$ edges such that $G-X$ contains no directed cycle.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.