The Erdos-Posa theorem, named for Paul Erdos and Lajos Posa, relates two parameters of a graph: the largest number of vertex-disjoint cycles it contains, and the smallest size of a feedback vertex set, a set of vertices meeting every cycle. The theorem shows these two quantities are related by a function f(k), so a graph with no k vertex-disjoint cycles has a feedback vertex set bounded in terms of k, even though the gap between the two parameters can grow arbitrarily large in particular graphs. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Erdos-Posa theorem (Wikipedia)
Sources
1. Erdos-Posa theorem (Wikipedia)
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.