I graduated from Eötvös Loránd University in 2011, and after finishing Part III in Cambridge, I started grad school at UCLA in 2012, just to move to ETH a year later. I received my PhD from ETH Zürich in 2016. My advisor was Benny Sudakov.

I am mostly interested in extremal & probabilistic combinatorics and discrete geometry, including connections to other fields, such as algebra or theoretical computer science.

- E-mail:
__daniel.korandi__at__epfl.ch__

- On the Turán number of ordered forests
(with Gábor Tardos, István Tomon and Craig Weidert),
*submitted*.- An extended abstract
for Eurocomb 2017 appeared in:
*Electronic Notes in Discrete Mathematics*61 (2017), 773-779.

- An extended abstract
for Eurocomb 2017 appeared in:
- Rainbow saturation and graph capacities,
*SIAM Journal on Discrete Mathematics*, to appear. - Monochromatic cycle covers in random graphs
(with Frank Mousset, Rajko Nenadov, Nemanja Škorić and Benny Sudakov),
*submitted*. - On the Turán number of some ordered even cycles
(with Ervin Győri, Abhishek Methuku, István Tomon, Casey Tompkins and Máté Vizer),
*submitted*. - Domination in 3-tournaments
(with Benny Sudakov),
*Journal of Combinatorial Theory, Series A*146 (2017) 165-168. - Saturation in random graphs
(with Benny Sudakov),
*Random Structures & Algorithms*51 (2017), 169-181. - A random triadic process
(with Yuval Peled and Benny Sudakov),
*SIAM Journal on Discrete Mathematics*30 (2016), 1-19.- An extended abstract
for Eurocomb 2015 appeared in:
*Electronic Notes in Discrete Mathematics*49 (2015), 189-196.

- An extended abstract
for Eurocomb 2015 appeared in:
- Decomposing random graphs into few cycles and edges
(with Michael Krivelevich and Benny Sudakov),
*Combinatorics, Probability and Computing*24 (2015), 857-872. [slides] -
*K*-saturated bipartite graphs (with Wenying Gan and Benny Sudakov),_{s,t}*European Journal of Combinatorics*45 (2015), 12-20. [slides] - Separating path systems
(with Victor Falgas-Ravry, Teeradej Kittipassorn, Shoham Letzter and Bhargav Narayanan),
*Journal of Combinatorics*5 (2014), 335-354.

- Spring 2018: Lecturer for Graph Theory

- Fall 2017: TA for Linear Algebra
- Spring 2017: TA for Graph Theory
- Fall 2016: TA for Discrete Mathematics

- Spring 2016: TA for Graph Theory
- Fall 2015: Course organizer for Analysis III D-BAUG
- Spring 2015: TA for Graph Theory
- Fall 2014: TA for Algebraic Methods in Combinatorics
- Spring 2014: Reader for Algebra II
- Fall 2013: TA for Algebra I

- Spring 2013: TA for MATH 180 (Combinatorics)
- Winter 2013: TA for MATH 180 (Combinatorics)
- Fall 2012: TA for MATH 61 (Introduction to Discrete Structures)