×

zbMATH — the first resource for mathematics

Infinite, highly connected digraphs with no two arc-disjoint spanning trees. (English) Zbl 0665.05023
The authors give a construction of countably infinite, highly connected graphs and digraphs which shows that various results involving connectivity cannot be extended to the infinite case.
Reviewer: J.W.Moon

MSC:
05C40 Connectivity
05C20 Directed graphs (digraphs), tournaments
05C05 Trees
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aharoni, J. Combinat. Theory Ser. B
[2] Edge-disjoint branchings, Combinatorial Algorithms, Academic Press, New York (1973) 91–96.
[3] Mader, Combinatorica 1 pp 385– (1981)
[4] Mader, Graphs Combinat. 1 pp 81– (1985)
[5] Nash-Williams, Can. J. Math. 12 pp 555– (1960) · Zbl 0096.38002 · doi:10.4153/CJM-1960-049-6
[6] Oxley, J. Combinat. Theory Ser. B 26 pp 123– (1979)
[7] Thomassen, J. Graph Theory 5 pp 351– (1981)
[8] Configurations in graphs of large minimum degree, connectivity or chromatic number, Proceedings of the Third International Conference on Combinatorial Mathematics, Academic Science, New York, to appear. · Zbl 0709.05030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.