Premium
Large k ‐preserving sets in infinite graphs
Author(s) -
Huck Andreas,
Niedermeyer Frank,
Shelah Saharon
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180411
Subject(s) - mathematics , combinatorics , conjecture , graph , set (abstract data type) , discrete mathematics , computer science , programming language
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 .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom