Vyuka - Teorie grafovych minoru

Datum	Obsah prednasky	Zdroje
10.10.	Opakovani, definice, hlavni myslenky a ingredience dukazu.
18.10. a 24.10.	Stromova sirka a tangle.	Minory X
25.10.	Velka stromova sirka vynucuje velkou zed.	Quickly Excluding a Planar Graph (structure of the proof)
1.11. a 8.11.	Plochy a linkovani.	Minory VI, VII a VIII
21.11.	Tangle a metrika na plochach.	Minory XII
22.11.	2-linkage.	Minory IX
28.11.	Transakce.	Minory IX
29.11.,5.12	Rozsirovani vnoreni.	Minory XIV a XV
6.12.	Strukturalni veta.	Minory XVI, plan utoku.
19.12.,20.20.	Testovani existence minoru.	Minory XIII,XXI,XXII
3.1.	Stromove rozklady a dobre usporadani.	Minory IV
9.1.	Kuratovskeho veta pro obecne plochy.	A simpler proof of the excluded minor theorem for higher surfaces.
10.1.	Wagnerova hypoteza.	Minory X, XX

Kopie vsech zde uvedenych clanku mam k dispozici a mohu na pozadani zapujcit.

N. Robertson, P. Seymour: Graph Minors. I. - XXIII.
N. Robertson, P. Seymour, R. Thomas: Quickly Excluding a Planar Graph, J. Comb. Theory, Ser. B(1994), 323-348.
C. Thomassen: A simpler proof of the excluded minor theorem for higher surfaces, J.Combinatorial Theory B 70 (1997), 306-311.
K. Kawarabayashi, P. Wollan: A simpler algorithm and shorter proof for the graph minor decomposition, STOC 2011, 451-458.
M. Grohe, K. Kawarabayashi, D. Marx, P. Wollan: Finding topological subgraphs is fixed-parameter tractable, STOC 2011, 479-488.