✦ LIBER ✦

Proof of Mader's conjecture on k-critical n-connected graphs

✍ Scribed by Su Jianji

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 201 KB
Volume: 45
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10164

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Mader conjectured that every k‐critical n‐connected noncomplete graph G has 2k + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of G is greater than (k + 2)n. Now we settle this conjecture completely. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 281–297, 2004

📜 SIMILAR VOLUMES

On k-con-Critically n-Connected Graphs

✍ W. Mader 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We prove that every n-connected graph G of sufficiently large order contains a connected graph H on four vertices such that G À V ðH Þ is ðn À 3Þ-connected. This had been conjectured in Mader (High connectivity keeping sets in n-connected graphs, Combinatorica, to appear). Furthermore, we prove uppe

Proof of a Conjecture of Mader, Erdös an

Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs

✍ B. Bollobás; A. Thomason 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 89 KB

We show that every graph G of size at least 256 p 2 |G| contains a topological complete subgraph of order p. This slight improvement of a recent result of Komlós and Szemerédi proves a conjecture made by Mader and by Erdös and Hajnal.