Erdős–Pósa theorem
id:
erd-s-p-sa-theorem-249-14983071
title:
Erdős–Pósa theorem
text:
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 contains one vertex from every cycle.
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical discipline of graph theory
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93P%C3%B3sa_theorem
date created:
date modified:
2024-01-04T02:24:02Z
main entity:
{"identifier":"Q5385325","url":"https://www.wikidata.org/entity/Q5385325"}
image:
fields total:
13
integrity:
14