Ubiquity and the Farey graph

DOI10.1016/j.ejc.2021.103326zbMath1466.05051arXiv1912.02147OpenAlexW3138963982MaRDI QIDQ2033934

Jan Kurkofka

Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

countable planar graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55)

Related Items (3)

Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ The immersion-minimal infinitely edge-connected graph ⋮ The Farey graph is uniquely determined by its connectivity

Cites Work

• Unnamed Item
• Typical subgraphs of 3- and 4-connected graphs
• A problem concerning infinite graphs
• A note on a problem of Halin's
• Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)
• Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen
• Classes of locally finite ubiquitous graphs
• Edge-disjoint double rays in infinite graphs: a Halin type result
• Office Hours with a Geometric Group Theorist
• Simplicial Decompositions of Infinite Graphs
• On disjoint configurations in infinite graphs
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• A remark on infinite edge-disjoint systems of paths in a graph

This page was built for publication: Ubiquity and the Farey graph