| Display title | Erdős–Pósa theorem |
| Default sort key | Erdos-Posa theorem |
| Page length (in bytes) | 9,737 |
| Namespace ID | 0 |
| Page ID | 301712 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JMinHep |
| Date of page creation | 18:17, 6 February 2024 |
| Latest editor | imported>JMinHep |
| Date of latest edit | 18:17, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In the mathematical discipline of graph theory, the Erdős–Pósa theorem, named after Paul Erdős and Lajos Pósa, relates two parameters of a graph:
The size of the largest collection of vertex-disjoint cycles contained in the graph;
The size of the smallest feedback vertex set in the graph: a set that... |
