Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
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 QIDQ1984516FDOQ1984516


Authors: Jan Kurkofka Edit this on Wikidata


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

minorconnectivityinfinite graphcharacterisationFarey 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)


Cites Work

  • Title not available (Why is that?)
  • Profinite groups.
  • Office hours with a geometric group theorist
  • Ubiquity and the Farey graph


Cited In (4)

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





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1984516)

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