TU Wien:Diskrete Mathematik für Informatik VU (Gittenberger)/Übungstest 2019-11-08
Zur Navigation springen
Zur Suche springen
1) Find three equivalent but different statements to "T is a tree". Choose two of them and prove their equivalence.
2) Apply the matrix-tree theorem to find the number of spanning forests in a graph with two components.
3) Is {{a, b, c}, {{}, {a}, {b}, {c}, {a, b}, {a, c}}} an independence system? Is it even a matroid?