Difference between revisions of "TU Wien:Diskrete Mathematik für Informatik VU (Gittenberger)/Übungstest 2019-11-08"

From VoWi
Jump to navigation Jump to search
(Die Seite wurde neu angelegt: „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 th…“)
(No difference)

Revision as of 10:17, 9 November 2019

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}, {0, {a}, {b}, {c}, {a, b}, {a, c}}} an independence system? Is it even a matroid?