I am mostly interested in extremal & probabilistic combinatorics and discrete geometry, including connections to other fields, such as algebra or theoretical computer science.
Research papers
 Improved Ramseytype results in comparability graphs
(with István Tomon),
submitted.
 On the Turán number of ordered forests
(with Gábor Tardos, István Tomon and Craig Weidert),
Journal of Combinatorial Theory, Series A, accepted.
An extended abstract
for Eurocomb 2017 appeared in:
Electronic Notes in Discrete Mathematics 61 (2017), 773779.
 Monochromatic cycle covers in random graphs
(with Frank Mousset, Rajko Nenadov, Nemanja Škorić and Benny Sudakov),
Random Structures & Algorithms 53 (2018), 667691.
 Rainbow saturation and graph capacities,
SIAM Journal on Discrete Mathematics 32 (2018), 12611264.
 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),
European Journal of Combinatorics 73 (2018), 8188.
 Domination in 3tournaments
(with Benny Sudakov),
Journal of Combinatorial Theory, Series A 146 (2017) 165168.
 Saturation in random graphs
(with Benny Sudakov),
Random Structures & Algorithms 51 (2017), 169181.
 A random triadic process
(with Yuval Peled and Benny Sudakov),
SIAM Journal on Discrete Mathematics 30 (2016), 119.
An extended abstract
for Eurocomb 2015 appeared in:
Electronic Notes in Discrete Mathematics 49 (2015), 189196.
 Decomposing random graphs into few cycles and edges
(with Michael Krivelevich and Benny Sudakov)
[slides],
Combinatorics, Probability and Computing 24 (2015), 857872.
 K_{s,t}saturated bipartite graphs
(with Wenying Gan and Benny Sudakov)
[slides],
European Journal of Combinatorics 45 (2015), 1220.
 Separating path systems
(with Victor FalgasRavry, Teeradej Kittipassorn, Shoham Letzter and Bhargav Narayanan),
Journal of Combinatorics 5 (2014), 335354.
