Combinatorics and graphs II (NDMI012)

Jan Hubička, hubicka@kam.mff.cuni.cz

Office hours: by appointment (prefferably Tuesday or Wednesday). S322 (Malostranské nám. 25, 3rd floor).

Literature

Recorded lectures by Vít Jelínek (Czech)
[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