Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Farey graph is uniquely determined by its connectivity

From MaRDI portal
Publication:1984516
Jump to:navigation, search

DOI10.1016/j.jctb.2021.06.006OpenAlexW3173808388MaRDI QIDQ1984516

Jan Kurkofka

Publication date: 16 September 2021

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

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


zbMATH Keywords

characterisationminorconnectivityinfinite graphFarey graphinfinite edge-connectivityinfinitely edge-connected graphtypical pi-graph


Mathematics Subject Classification ID

Graph theory (05Cxx) Special aspects of infinite or finite groups (20Fxx) Structure and classification of infinite or finite groups (20Exx)


Related Items (3)

Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ Duality theorems for stars and combs I: Arbitrary stars and combs ⋮ The immersion-minimal infinitely edge-connected graph




Cites Work

  • Ubiquity and the Farey graph
  • Office Hours with a Geometric Group Theorist
  • Profinite Groups
  • Unnamed Item




This page was built for publication: The Farey graph is uniquely determined by its connectivity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1984516&oldid=14437763"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki