TU Wien:Diskrete Mathematik für Informatik VU (Gittenberger)/Übungstest 2019-11-08: Unterschied zwischen den Versionen

Aus VoWi
Zur Navigation springen Zur Suche springen
(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…“)
 
 
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 1: Zeile 1:
 
1) Find three equivalent but different statements to "T is a tree". Choose two of them and prove their equivalence.
 
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.
 
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?
+
 
 +
3) Is {{a, b, c}, {{}, {a}, {b}, {c}, {a, b}, {a, c}}} an independence system? Is it even a matroid?

Aktuelle Version vom 9. November 2019, 09:19 Uhr

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?