𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Pósa's Conjecture for Random Graphs

✍ Scribed by Kühn, Daniela; Osthus, Deryk

Book ID
118197187
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
321 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ádám's conjecture for circulant graph
On Ádám's conjecture for circulant graphs
✍ Mikhail Muzychuk 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Adfim's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulant) graphs to be isomorphic. It is known that the conjecture fails if n is divisible by either 8 or by an odd square. On the other hand, it was shown in [?] that the conjecture is true for circulant graphs w

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