Infinite, highly connected digraphs with no two arc-disjoint spanning trees

DOI10.1002/jgt.3190130110zbMath0665.05023OpenAlexW2073756810MaRDI QIDQ3816091

Ron Aharoni, Carsten Thomassen

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130110

zbMATH Keywords

connectivityinfinite graphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (13)

Matroid intersection, base packing and base covering for infinite matroids ⋮ On spanning tree packings of highly edge connected graphs ⋮ Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs ⋮ An analogue of Edmonds' branching theorem for infinite digraphs ⋮ Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity ⋮ What is on his mind? ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Extremal infinite graph theory ⋮ Orientations of infinite graphs with prescribed edge-connectivity ⋮ A Cantor-Bernstein-type theorem for spanning trees in infinite graphs ⋮ Infinite highly connected planar graphs of large girth ⋮ Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths ⋮ Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair

Cites Work

• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Unnamed Item

This page was built for publication: Infinite, highly connected digraphs with no two arc-disjoint spanning trees