M. Sc. Christian Winter
-
Tuesdays, 13:30-14:30, or by appointment
-
Kollegiengebäude Mathematik (20.30)
1.025
-
christian.winter@kit.edu
Semester | Titel | Typ |
---|---|---|
Summer Semester 2022 | Combinatorics | Lecture |
AG Discrete Mathematics | Seminar | |
Winter Semester 2021/22 | Advanced Mathematics I (Lecture) | Lecture |
Position: Ph.D. student under the guidance of Maria Axenovich, research group Discrete Mathematics.
Research Interest: Extremal Combinatorics, in particular Ramsey-type and saturation problems concerning inter alia:
- Graphs
- (Non-uniform) hypergraphs
- Posets and Boolean lattices
Publications:
- C. Winter. Poset Ramsey number R(P, Q_n). II. Antichains. Preprint on arXiv.
- C. Winter. Poset Ramsey number R(P, Q_n). I. Complete multipartite posets. Submitted, preprint on arXiv.
- M. Axenovich, C. Winter. Poset Ramsey numbers: large Boolean lattice versus a fixed poset. Submitted, preprint on arXiv.
- C. Winter. Lower Bound on the Size-Ramsey Number of Tight Paths. Submitted, preprint on arXiv.
- C. Winter. Size-Ramsey Number of Uniform Hypergraph Paths. Master Thesis, University of Hamburg, 2021. (available here)
- M. Axenovich, C. Winter. A note on saturation for Berge-G hypergraphs. Graphs and Combinatorics, Volume 35, Issue 4, 933-939, 2019. (see preprint on arXiv)
- C. Winter. Berge saturation of non-uniform hypergraphs. Bachelor Thesis, Karlsruhe Institute of Technology, 2018. (available here)