Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor

DOI10.1007/s00208-021-02259-7zbMath1486.05212arXiv2004.06710OpenAlexW3204880066MaRDI QIDQ2122083

Jan Kurkofka

Publication date: 5 April 2022

Published in: Mathematische Annalen (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theory\(k\)-connected subgraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Connectivity (05C40) Infinite graphs (05C63)

Related Items (1)

The immersion-minimal infinitely edge-connected graph

Cites Work

• Typical subgraphs of 3- and 4-connected graphs
• Excluding infinite minors
• The Farey graph is uniquely determined by its connectivity
• Ubiquity and the Farey graph
• Abstract separation systems
• Tree sets
• Duality in Infinite Graphs
• Excluding Subdivisions of Infinite Cliques
• Excluding Infinite Trees

This page was built for publication: Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor