Characterising \(k\)-connected sets in infinite graphs

DOI10.1016/j.jctb.2022.08.004zbMath1497.05191arXiv1811.06411OpenAlexW4289287887MaRDI QIDQ2171028

Karl Heuer, J. Pascal Gollin

Publication date: 23 September 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.06411

zbMATH Keywords

connectivityduality theoreminfinite graphs\(k\)-connected sets\(k\)-tree-widthstructural characterisation of families of graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Infinite graphs (05C63)

Related Items (3)

Duality theorems for stars and combs I: Arbitrary stars and combs ⋮ Ubiquity of graphs with nowhere‐linear end structure ⋮ Halin's end degree conjecture

Cites Work

• Unnamed Item
• Typical subgraphs of 3- and 4-connected graphs
• A Menger-like property of tree-width: The finite case
• The Menger-like property of the three-width of infinite graphs
• Set theory. An introduction to independence proofs
• Highly connected sets and the excluded grid theorem
• Quickly excluding a planar graph
• Graph-theoretical versus topological ends of graphs.
• Infinite end-devouring sets of rays with prescribed start vertices
• Profinite separation systems
• Extremal infinite graph theory
• Tree sets
• Representations of infinite tree sets
• Graph Theory
• Simplicial Decompositions of Infinite Graphs
• $k$-Blocks: A Connectivity Invariant for Graphs
• Über die Maximalzahl fremder unendlicher Wege in Graphen

This page was built for publication: Characterising \(k\)-connected sets in infinite graphs