Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2005_09_18_aharoni_berger: Proves that any digraph has a family of disjoint A-B paths and an A-B separator choosing one vertex from each path, so the undirected question follows; refereed in 2009 and credited by the site's curator.
Linked from (1)
Graph