Page "Sperner family" Paragraph 24
from
Wikipedia
# Let G be a connected graph and let H be the clutter on consisting of all edge sets of spanning trees of G. Then is the collection of all minimal edge cuts in G.
Page 1 of 1.
1.955 seconds.