I am a mathematician with an interest in combinatorics. Currently, I am lucky to find myself as a PhD student under the supervision of Raphael Steiner and Benny Sudakov at ETH Zürich. My research interests include random graphs, ramsey theory, directed graphs and a variety of "rainbow" questions in combinatorics.
If you want to correspond with me, please do not hesitate to reach out! My email address is
micha dot christoph at math dot ethz dot ch.
On a Ramsey-Turán variant of Roth's theorem (with Matija Bucić, Jaehoon Kim, Hyunwoo Lee and Varun Sivashankar)
New bounds for linear arboricity and related problems (with Nemanja Draganić, António Girão, Eoin Hurley, Lukas Michel and Alp Müyesser)
Cycle-factor of regular graphs via entropy (with Nemanja Draganić, António Girão, Eoin Hurley, Lukas Michel and Alp Müyesser)
Proof of the KAMAK tree conjecture (with Raphael Steiner)
Universality for transversal Hamilton cycles in random graphs (with Anders Martinsson and Aleksa Milojević)
Almost-perfect colorful matchings in three-edge-colored bipartite graphs (Simona Boyadzhiyska and Tibor Szabó )
Almost-full transversals in equi-squares (with Debsoumya Chakraborti, Zach Hunter, RIchard Montgomery and Teo Petrov )
Unique subgraphs are rare (with Domagoj Bradač)
Topological Minors in Typical Lifts (with Matija Bucić, Alp Müyesser and Raphael Steiner)
The Hamilton space of pseudorandom graphs (with Kalina Petrova and Rajko Nenadov)
Improved bounds for zero-sum cycles in Zpd (with Charlotte Knierim, Anders Martinsson and Raphael Steiner)
A note on digraph splitting (with Kalina Petrova and Raphael Steiner)
Resolution of the Kohayakawa–Kreuter conjecture (with Anders Martinsson, Raphael Steiner and Yuval Wigdersson)
The power of many colours (with Noga Alon, Matija Bucić, Michael Krivelevich)
Minimum Degree Threshold for -factors with High Discrepancy (with Domagoj Bucić and Lior Gishboliner)
A list of my publications is also available on Google Scholar and arXiv.