66 citations · 206 across the 36 of their papers we have counts for
1 paper · 2 filters
Serge Gaspers
Let f(k) denote the maximum such that every simple undirected graph containing two vertices s,t and k edge-disjoint s-t paths, also contains two vertices u,v and f(k) independent u…