Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,286 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Cycle (graph theory)
Feedback vertex set
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
DİABETES MELLİTUSUN DİYET TEDAVİSİNDE POSA KAYNAKLARI, TÜRLERİ VE ETKİLERİ
Neslihan Öner
,
Y. Firat
2018
Corpus ID: 86413806
Diyabet dunyada ve ulkemizde prevalansi artan kronik ve ilerleyici bir hastaliktir. Tedavisinin temelini olusturan kan glikozunun…
Expand
2018
2018
«De una tarde de agosto» i «Oh, Dimecres de Cendra, que estens…»: vers una teoria de la lectura en Maragall?
Ignasi Moreta
2018
Corpus ID: 186464383
Als textos «De una tarde de agosto» i «Oh, Dimecres de Cendra, que estens…», Maragall posa les bases del que hauria pogut ser una…
Expand
2018
2018
M ay 2 01 8 Erdős-Pósa property for labelled minors : 2-connected minors
H. Bruhn
,
Felix Joos
,
Oliver Schaudt
2018
Corpus ID: 53399644
In the 1960s, Erdős and Pósa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor…
Expand
2015
2015
Vers una visió comuna de l'Església. La X Assemblea del Consell Mundial d'Esglésies (Corea 2013)
Antoni Matabosch
2015
Corpus ID: 194160439
La X Assemblea del Consell Mundial d’Esglesies, celebrada el noviembre de 2013 a Busan (Coreadel Sud) ha fet un balanc del…
Expand
2013
2013
Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles
F. Fomin
,
D. Lokshtanov
,
Neeldhara Misra
,
Geevarghese Philip
,
Saket Saurabh
Journal of Graph Theory
2013
Corpus ID: 14226250
According to the classical Erdős–Pósa theorem, given a positive integer k, every graph G either contains k vertex disjoint cycles…
Expand
2012
2012
List-coloring graphs without subdivisions and without immersions
K. Kawarabayashi
,
Yusuke Kobayashi
ACM-SIAM Symposium on Discrete Algorithms
2012
Corpus ID: 2499458
A graph G contains a subdivision of H if G contains a subgraph which is isomorphic to a graph that can be obtained from H by…
Expand
2011
2011
A new space--time multivariate approach for environmental data analysis
S. Iaco
2011
Corpus ID: 55448532
Air quality control usually requires a monitoring system of multiple indicators measured at various points in space and time…
Expand
2011
2011
Què posa aquí
Gabriel Babiloni
2011
Corpus ID: 173467124
2008
2008
Improving the gap of Erdös-Pósa property for minor-closed graph classes
F. Fomin
,
Saket Saurabh
,
D. Thilikos
Cologne Twente Workshop on Graphs and…
2008
Corpus ID: 26508785
1998
1998
Contamination observed on the Passive Optical Sample Assembly-I (POSA-I) experiment
J. Zwiener
,
Rachel R. Kamenetzky
,
J. Vaughn
,
M. Finckenor
Optics & Photonics
1998
Corpus ID: 136670280
The passive optical sample assembly-I (POSA-I), part of the Mir Environmental Effects Payload (MEEP), was designed to study the…
Expand
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)
ACCEPT & CONTINUE