Pages that link to "Item:Q3816091"
From MaRDI portal
The following pages link to Infinite, highly connected digraphs with no two arc-disjoint spanning trees (Q3816091):
Displaying 14 items.
- Matroid intersection, base packing and base covering for infinite matroids (Q276439) (← links)
- On spanning tree packings of highly edge connected graphs (Q401495) (← links)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity (Q503651) (← links)
- What is on his mind? (Q709300) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- Infinite highly connected planar graphs of large girth (Q998244) (← links)
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907) (← links)
- An analogue of Edmonds' branching theorem for infinite digraphs (Q2225436) (← links)
- Extremal infinite graph theory (Q2275380) (← links)
- Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths (Q2833123) (← links)
- Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs (Q4604019) (← links)
- Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair (Q5272632) (← links)
- Orientations of infinite graphs with prescribed edge-connectivity (Q5915870) (← links)
- The Nash-Williams orientation theorem for graphs with countably many ends (Q6655682) (← links)
