Reinhard Diestel

Forschungsseminar und AG, WS2012-13

  Forschungsseminar:  freitags 16-18 in 435, vorher Tee in 233 ab 15:45
Arbeitsgemeinschaften: in 233, Zeit nach Ankźndigung
________________________________________


27/8/2012 9-11, Representations of infinite matroids (Rudi Pendavingh)

27/8/2012 14-16, State of the art in infinite matroids, post-Maastricht (Nathan Bowler)

15-19.10.2012 Blockseminar Unendliche Matroide in Sprštze

26.10. 2012 Reinhard Diestel, Forcing finite minors in locally finite graphs by large-degree assumptions

2.11. 2012 Christian Reiher, Kšnig's theorem for infinite graphs

7.11.2012 10:00-11:30 in 233, Christian Reiher, Details of the proof of Kšnig's theorem

9.11.2012 Fabian Hundertmark, Capturing the tree-structure of nested set partitions 1

16.11.2012 Fabian Hundertmark, Capturing the tree-structure of nested set partitions 2

20.11.2012 16:00 in 233, Comparing Fabian's trees with other combinatorial notions of trees

23.11.2012 Hiu Fai Law, Independent sets in graphs with given minimum degree

28.11.2012 16:00 in 233, Matthias Hamann, Introduction to hyperbolic graphs

30.11.2012 Matthias Hamann, Group actions on hyperbolic graphs

4.12.2012 16:00 in 233, Hadi Afzali & Hiu Fai Law, Infinite gammoids

7.12.2012 Nathan Bowler, Gluing together infinite trees of matroids

11.12.2012 16:00 in 233, Johannes Carmesin, Trees of matroids with adhesion >1

12.12.2012 15:15 in 1313, Elad Aigner-Horev, Equidistribution I

13.12.2012 15:15 in 1643, Elad Aigner-Horev, Equidistribution II

14.12.2012 16:00-17:30, Julian Pott, Arbitrarily to infinitely many edge-disjoint double rays

18.12.2012 14:00 in 233, Julian Pott, Arbitrarily to infinitely many edge-disjoint double rays continued


3.1.2013 10:00 in 233, Henning Bruhn, Frankl's union-closed sets conjecture is almost always true

8.1.2013 16:00 in 233, Johannes Carmesin, A Menger-type result for psi-matroids

11.1.2013 Hiu Fai Law & Malte Mźller, Infinite gammoids

25.1.2013 16ct in 435, Hadi Afzali, Hiu Fai Law & Malte Mźller, Transversal matroids, gammoids, and their duality for infinite graphs and digraphs

1.2.2013 Elad Aigner-Horev, An introduction to Bohr sets I

6.2.2013 16ct in 430, Elad Aigner-Horev, An introduction to Bohr sets II

8.2.2013 16ct in 435, Oliver Cooley, Finding large planar subgraphs

12.2.2013 14ct in 233, Nathan Bowler, Well-quasi-ordering theory with unusual quantifiers

15.2.2013 Johannes Carmesin, How tame matroids are determined by their tree decompositions

---------------

Vorschau:

Jan-Oliver Fršhlich & Julian Pott, (2k+2)-connected graphs of bounded tree-width are k-linked

Theo Mźller et al, (2k+3)-connected graphs are k-linked

Reinhard Diestel & Tsz Lung Chan, Plane duality for locally finite graphs

Christian Reiher, The Erdős-Faber-Lovasz conjecture

Johannes Carmesin & Nathan Bowler, A splitter theorem for infinite matroids

Julian Pott, Digraph minors

Johannes Carmesin, Harmonic functions of finite l^p norm

Georg Zetzsche...