✦ LIBER ✦

The Erdős–Pósa Property For Long Circuits

✍ Scribed by Etienne Birmelé; J. Adrian Bondy; Bruce A. Reed

Book ID: 106167623
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 211 KB
Volume: 27
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-007-0047-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Erdős–Pósa property for clique minor

The Erdős–Pósa property for clique minors in highly connected graphs

✍ Reinhard Diestel; Ken-ichi Kawarabayashi; Paul Wollan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The Erdős–Pósa Property for Odd Cycles i

The Erdős–Pósa Property for Odd Cycles in Highly Connected Graphs

✍ Dieter Rautenbach; Bruce Reed 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 201 KB

The Erdős–Pósa Property for Odd Cycles i

The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity

✍ Carsten Thomassen 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 218 KB

Strengthening Erdös–Pósa property for mi

Strengthening Erdös–Pósa property for minor-closed graph classes

✍ Fedor V. Fomin; Saket Saurabh; Dimitrios M. Thilikos 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

Let H and G be graph classes. We say that H has the Erd" os-Pósa property for G if for any graph G ∈ G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). Robertso

A new proof and generalizations of a the

A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits

✍ M. Simonovits 📂 Article 📅 1967 🏛 Akadmiai Kiad 🌐 English ⚖ 982 KB

Another Look at the Erdős–Hajnal–Pósa Re

Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph

✍ Norbert Sauer 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 221 KB