|
About me
I am a third year PhD student with Christian Reiher
and Mathias Schacht. Previously, I have completed my Bachelor's degree at the University of Bonn,
my Master's degree (supervised by Christian Reiher) at the University of Hamburg and I have worked for an AI/robotics company in Tokyo. My research area is combinatorics,
in particular extremal combinatorics. The topics I am interested in include various problems in extremal set theory,
spanning structures in graphs and hypergraphs, problems in coloured graphs, and questions related to the Turán problem. To attack these problems I sometimes use tools like the absorption method, the
hypergraph regularity lemma, and probabilistic approaches. This
is me on arxiv, and this is me on ResearchGate.
Articles
- Decomposing hypergraphs into cycle factors,
with Felix Joos and Marcus Kühn, submitted
- A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs,
submitted (this is a new version with an improved main result)
- r-cross t-intersecting families via necessary intersection points, with Pranshu Gupta, Yannick Mogge, and Simón Piga, submitted
- On Hamiltonian cycles in hypergraphs with dense link graphs, with Joanna Polcyn, Christian Reiher, and Vojtěch Rödl, to appear in Journal of Combinatorial Theory, Series B
- Covering 3-edge-coloured random graphs with monochromatic trees, with
Yoshiharu Kohayakawa, Guilherme Mota, and Walner Mendonça, to appear in SIAM Journal on Discrete Mathematics
- On extremal problems concerning the traces of sets, with Simón Piga, to appear in Journal of Combinatorial Theory, Series A
- Short proof that Kneser graphs are Hamiltonian for n ≥ 4k,
with Johann Bellmann, to appear in Discrete Mathematics
- Convex graphon parameters and graph norms,
with Joonkyung Lee, to appear in Israel Journal of Mathematics
- Embedding spanning subgraphs in uniformly dense and inseparable graphs,
with Oliver Ebsen, Giulia S. Maesaka, Christian Reiher, and Mathias Schacht, Random Structures and Algorithms 2020; 57: 1077– 1096
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs,
with Joanna Polcyn, Christian Reiher, Vojtěch Rödl, Andrzej Ruciński, and Mathias Schacht, Acta Mathematica Hungarica 161, 647–699 (2020) (Special issue dedicated to Endre Szemerédi's 80th birthday)
Extended abstracts
- Maximum size of r-cross t-intersecting families,
with Pranshu Gupta, Yannick Mogge, and Simón Piga, to appear in LAGOS 2021
- Minimum pair-degree for tight Hamiltonian cycles in 4-uniform hypergraphs,
with Christian Reiher, Vojtěch Rödl, Andrzej Ruciński, and Mathias Schacht, Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 1023–1027
- Covering 3-coloured random graphs with monochromatic trees,
with Yoshiharu Kohayakawa, Guilherme Mota, and Walner Mendonça, Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 871–875
- Powers of Hamiltonian cycles in μ-inseparable graphs,
with Oliver Ebsen, Giulia S. Maesaka, Christian Reiher, and Mathias Schacht, Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 637–641
Talks
- Extremal problems concerning the traces of sets, Warwick combinatorics seminar, June '20, Warwick (online)
- Minimum pair-degree for tight Hamiltonian cycles in 4-uniform hypergraphs, EUROCOMB '19, Aug '19, Bratislava
- Powers of Hamiltonian cycles in μ-inseparable graphs, Random structures & algorithms '19, July '19, Zurich
- A different Absorbing Lemma for the cycle partitioning problem in r-coloured K_n, Berlin-Poznań-Hamburg-Warsaw Seminar on Discrete Mathematics '19, May '19,Warsaw
- A pair-degree condition for Hamiltonian cycles in 3-uniform hypergraphs, Combinatorics Seminar at the Emory University, Feb '19, Atlanta
Teaching
- Teaching assistant for the lecture 'Graph theory 1', Summer 20
- Teaching assistant for the lecture 'Extremal graph theory', Winter 19/20
- Teaching assistant for the lecture 'Mathematics 1 for computer scientists', Winter 19/20
Other interests
|
