The Farey graph is uniquely determined by its connectivity
Combinatorics
2021-06-23 v2 Algebraic Geometry
Dynamical Systems
Group Theory
Number Theory
Abstract
We show that, up to minor-equivalence, the Farey graph is the unique minor-minimal graph that is infinitely edge-connected but such that every two vertices can be finitely separated.
Keywords
Cite
@article{arxiv.2006.12472,
title = {The Farey graph is uniquely determined by its connectivity},
author = {Jan Kurkofka},
journal= {arXiv preprint arXiv:2006.12472},
year = {2021}
}
Comments
9 pages, 1 figure. arXiv admin note: text overlap with arXiv:2004.06710