1 paper · 1 filter
Erika Bérczi-Kovács, András Frank
One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of k disjoint spanning trees of a graph, along with its count…