Nash-Williams Orientation Conjecture for Infinite Graphs - Amena Assem
Title: Nash-Williams Orientation Conjecture for Infinite Graphs
Speaker: | Amena Assem |
Affiliation | University of Waterloo |
Location: | MC 5479 |
Abstract: In 1960 Nash-Williams proved that every 2k-edge-connected finite graph admits a k-arc-connected orientation. He conjectured that this is also true for infinite graphs. We try to prove the conjecture. Joint work with Bruce Richter.