scientific article; zbMATH DE number 15670
[For the entire collection see Zbl 0706.00007.] It was shown by the reviewer in [On infinite \(n\)-connected graphs. Cycles and rays: basic structures in finite and infinite graphs, Proc. NATO Adv. Res. Workshop, Montreal/Can. 1987, NATO ASI Ser., Ser. C 301, 151-160 (1990; Zbl 0717.05051)] that for every infinite cardinal number \(\alpha\), every \(\alpha\)-connected graph \(G\) of order \(\alpha\) does contain a vertex set \(S\) of cardinality \(\alpha\) such that for every \(S'\subseteq S\) the connectivity of \(G-S'\) remains \(\alpha\), and it was conjectured there that such a set \(S\) of cardinality \(\alpha\) also exists, if the order of \(G\) is larger than \(\alpha\). The main result of the given paper is a proof of this conjecture.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972314)