Every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor

Jan Kurkofka

doi:10.1007/s00208-021-02259-7

Every infinitely edge-connected graph contains the Farey graph or T_ℵ0∗ t as a minor

Jan Kurkofka^*

^*Corresponding author for this work

Mathematics

Research output: Contribution to journal › Article › peer-review

135 Downloads (Pure)

Abstract

We show that every infinitely edge-connected graph contains the Farey graph or T_ℵ0∗ t as a minor. These two graphs are unique with this property up to minor-equivalence.

Original language	English
Pages (from-to)	1881–1900
Number of pages	20
Journal	Mathematische Annalen
Volume	382
Issue number	3-4
Early online date	24 Sept 2021
DOIs	https://doi.org/10.1007/s00208-021-02259-7
Publication status	Published - Apr 2022

Access to Document

10.1007/s00208-021-02259-7Licence: Creative Commons: Attribution (CC BY)

KurkofkaJ2021EveryFinal published version, 664 KBLicence: Creative Commons: Attribution (CC BY)

Cite this

@article{7360c09d27444811993b0e941b80c69e,

title = "Every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor",

abstract = "We show that every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor. These two graphs are unique with this property up to minor-equivalence.",

author = "Jan Kurkofka",

year = "2022",

month = apr,

doi = "10.1007/s00208-021-02259-7",

language = "English",

volume = "382",

pages = "1881–1900",

journal = "Mathematische Annalen",

issn = "0025-5831",

publisher = "Springer",

number = "3-4",

}

TY - JOUR

T1 - Every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor

AU - Kurkofka, Jan

PY - 2022/4

Y1 - 2022/4

N2 - We show that every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor. These two graphs are unique with this property up to minor-equivalence.

AB - We show that every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor. These two graphs are unique with this property up to minor-equivalence.

U2 - 10.1007/s00208-021-02259-7

DO - 10.1007/s00208-021-02259-7

M3 - Article

SN - 0025-5831

VL - 382

SP - 1881

EP - 1900

JO - Mathematische Annalen

JF - Mathematische Annalen

IS - 3-4

ER -

Every infinitely edge-connected graph contains the Farey graph or Tℵ0 ∗ t as a minor

Abstract

Access to Document

Fingerprint

Cite this

Every infinitely edge-connected graph contains the Farey graph or T_ℵ0∗ t as a minor