- lectures: Tuesday 14:00, S4
- Tutorials: Monday 15:40, S11
- October 1
- Edmonds blossom algorithm [VM] (in Czech) [SV] [T] (None of texts proves lemma about blossom contraction correctly)
Practical: Lemma about blossom contraction

- October 8
- Tutte's theorem on perfect matchings, Petersen's theorem [D].
Practical: Finishing proof about blososm contraction. Hall theorem using Tutte's theorem

- October 15
- Lemma on contractible edge for 3-connected graphs, Tutte's characterisation of 3-connectivity [D], Kuratowski's and Wagner's theorem [D].

[Ba] P. Bartlett: Chordal graphs (lecture notes)

[BCh] The Bondy and Chvátal theorem

[Bo] B. Bollobás: Modern Graph Theory

[D] R. Diestel: Graph Theory

[EKR] The Erdős-Ko-Rado theorem

[HR] Y. Haimovitch, A. Raviv: Chordal graphs (ppt presentation)

[T] R. Tarjan: Sketchy notes on [...] blossom algorithm for general matching

[VM] T. Valla, J. Matoušek: Kombinatorika a grafy I

[SV] Amy Shoemaker and Sagar Vare: Edmonds’ Blossom Algorithm

[W] H. Wilf: Generatingfunctionology