Skip to search formSkip to main contentSkip to account menu

Erdős–Pósa theorem

Known as: Erdos-Posa theorem, Erdos–Posa theorem, Erdős-Pósa Theorem 
In the mathematical discipline of graph theory, the Erdős–Pósa theorem, named after Paul Erdős and Lajos Pósa, states that there is a function f(k… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Cycle (graph theory)Feedback vertex setGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Erdős-Pósa from ball packing
A classic theorem of Erdős and Posa (1965) states that every graph has either $k$ vertex-disjoint cycles or a set of $O(k \log k… 
2018
2018
Erdős-Pósa property of chordless cycles and its applications
A chordless cycle in a graph G is an induced subgraph of G which is a cycle of length at least four. We prove that the Erdős-Posa… 
2017
2017
Frames, A-Paths, and the Erdös-Pósa Property
A key feature of Simonovits' proof of the classic Erdos--Posa theorem is a simple subgraph of the host graph, a frame, that… 
2013
2013
Polynomial Gap Extensions of the Erdős-Pósa Theorem
Given a graph H, we denote by M(H) all graphs that can be contracted to H. The following extension of the Erdős-Posa Theorem… 
2013
2013
Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles
According to the classical Erdős–Pósa theorem, given a positive integer k, every graph G either contains k vertex disjoint cycles… 
2012
2012
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
The well-known Erdos-Posa theorem says that for any integer k and any graph G, either G contains k vertex-disjoint cycles or a… 
2012
2012
Edge-disjoint odd cycles in 4-edge-connected graphs
Highly Cited
2011
Highly Cited
2011
Packing cycles through prescribed vertices
2010
2010
An (almost) linear time algorithm for odd cycles transversal
We consider the following problem, which is called the <i>odd cycles transversal problem</i>. <b>Input:</b> A graph <i>G</i> and… 
2009
2009
The Erdös-Pósa property for matroid circuits
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)