Large k‐preserving sets in infinite graphs

DOI10.1002/jgt.3190180411zbMath0801.05045OpenAlexW1986140026MaRDI QIDQ4297826

Andreas Huck, Saharon Shelah, Frank Niedermeyer

Publication date: 27 November 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180411

zbMATH Keywords

connectivityinfinite graphselementary submodelsconjecture of Mader

Mathematics Subject Classification ID

Graph theory (05C99) Other combinatorial set theory (03E05) Connectivity (05C40)

Related Items (2)

High connectivity keeping sets in graphs and digraphs ⋮ Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

This page was built for publication: Large k‐preserving sets in infinite graphs