Premium
Infinite, highly connected digraphs with no two arc‐disjoint spanning trees
Author(s) -
Aharoni Ron,
Thomassen Carsten
Publication year - 1989
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190130110
Subject(s) - mathematics , combinatorics , disjoint sets , spanning tree , arc (geometry) , discrete mathematics , countable set , strongly connected component , geometry
We present a construction of countably infinite, highly connected graphs and digraphs, which shows that several basic connectivity results on finite graphs, including Edmondsapos;s branching theorem, cannot be extended to the infinite case.