Amena Assem

Edge-disjoint linkage in infinite graphs

In 1980, Thomassen stated his weak linkage conjecture: for an odd positive integer k, if a graph G is k-edge-connected, then, for any collection of k pairs of vertices {s_1,t_1}, ..., {s_k,t_k} in G, not necessarily distinct, there are pairwise edge-disjoint paths P_1,...,P_k in...