Abstract
Let K be a cardinal. If K χ0, define K:= K. Otherwise, let K := K + 1. We prove a conjecture of Mader: Every infinite K‐connected graph G = (V, E) contains a set S ⊆ V with |S| = |V| such that G/S is K‐connected for all S⊆ S.
Original language | English |
---|---|
Pages (from-to) | 413-426 |
Number of pages | 14 |
Journal | Journal of Graph Theory |
Volume | 18 |
Issue number | 4 |
DOIs | |
State | Published - Jul 1994 |