Large k‐preserving sets in infinite graphs

Andreas Huck*, Frank Niedermeyer, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 languageEnglish
Pages (from-to)413-426
Number of pages14
JournalJournal of Graph Theory
Volume18
Issue number4
DOIs
StatePublished - Jul 1994

Fingerprint

Dive into the research topics of 'Large k‐preserving sets in infinite graphs'. Together they form a unique fingerprint.

Cite this