Decomposing Random Graphs into Few Cycles and Edges. - Dániel Korándi; Michael Krivelevich; Benny Sudakov (Comb. Probab. Comput., 2015)

Ks, t-saturated bipartite graphs. - Wenying Gan; Dániel Korándi; Benny Sudakov (Eur. J. Comb., 2015)

A random triadic process. - Dániel Korándi; Yuval Peled; Benny Sudakov (Electron. Notes Discret. Math., 2015)

Domination in 3-tournaments. - Dániel Korándi; Benny Sudakov (J. Comb. Theory A, 2017)

Saturation in random graphs. - Dániel Korándi; Benny Sudakov (Random Struct. Algorithms, 2017)

On the Turán number of some ordered even cycles. - Ervin Györi; Dániel Korándi; Abhishek Methuku; István Tomon; Casey Tompkins; Máté Vizer (Eur. J. Comb., 2018)

Monochromatic cycle covers in random graphs. - Dániel Korándi; Frank Mousset; Rajko Nenadov; Nemanja Skoric; Benny Sudakov (Random Struct. Algorithms, 2018)

Rainbow Saturation and Graph Capacities. - Dániel Korándi (SIAM J. Discret. Math., 2018)

On the Turán number of ordered forests. - Dániel Korándi; Gábor Tardos; István Tomon; Craig Weidert (J. Comb. Theory A, 2019)

Improved Ramsey-type results for comparability graphs. - Dániel Korándi; István Tomon (Comb. Probab. Comput., 2020)

Large Homogeneous Submatrices. - Dániel Korándi; János Pach; István Tomon (SIAM J. Discret. Math., 2020)

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. - Matija Bucic; Dániel Korándi; Benny Sudakov (Comb., 2021)

Powers of paths in tournaments. - Nemanja Draganic; François Dross; Jacob Fox; António Girão; Frédéric Havet; Dániel Korándi; William Lochet; David Munhá Correia; Alex D. Scott; Benny Sudakov (Comb. Probab. Comput., 2021)

Minimum degree conditions for monochromatic cycle partitioning. - Dániel Korándi; Richard Lang; Shoham Letzter; Alexey Pokrovskiy (J. Comb. Theory B, 2021)

Decomposing Random Permutations into Order-Isomorphic Subpermutations. - Carla Groenland; Tom Johnston; Dániel Korándi; Alexander Roberts; Alex D. Scott; Jane Tan (SIAM J. Discret. Math., 2023)