| The maximum number of cliques in graphs without long cycles R Luo Journal of Combinatorial Theory, Series B 128, 219-226, 2018 | 72 | 2018 |
| Avoiding long Berge cycles Z Füredi, A Kostochka, R Luo Journal of Combinatorial Theory, Series B 137, 55-64, 2019 | 36 | 2019 |
| On r-uniform hypergraphs with circumference less than r A Kostochka, R Luo Discrete Applied Mathematics 276, 69-91, 2020 | 23 | 2020 |
| Extensions of a theorem of Erdős on nonhamiltonian graphs Z Füredi, A Kostochka, R Luo Journal of Graph Theory 89 (2), 176-193, 2018 | 18 | 2018 |
| Stability in the Erdős–Gallai theorem on cycles and paths, II Z Füredi, A Kostochka, R Luo, J Verstraëte Discrete Mathematics 341 (5), 1253-1263, 2018 | 17 | 2018 |
| A stability version for a theorem of Erdős on nonhamiltonian graphs Z Füredi, A Kostochka, R Luo Discrete Mathematics 340 (11), 2688-2690, 2017 | 15 | 2017 |
| Avoiding long Berge cycles II, exact bounds for all Z Furedi, A Kostochka, R Luo arXiv preprint arXiv:1807.06119, 2018 | 13 | 2018 |
| Towards the small quasi-kernel conjecture A Kostochka, R Luo, S Shan arXiv preprint arXiv:2001.04003, 2020 | 10 | 2020 |
| A variation of a theorem by Pósa Z Füredi, A Kostochka, R Luo Discrete Mathematics 342 (7), 1919-1923, 2019 | 9 | 2019 |
| On 2-connected hypergraphs with no long cycles Z Furedi, A Kostochka, R Luo arXiv preprint arXiv:1901.11159, 2019 | 9 | 2019 |
| Signed quasi-clique merger: A new clustering method for signed networks with positive and negative edges X Qi, R Luo, E Fuller, R Luo, CQ Zhang International Journal of Pattern Recognition and Artificial Intelligence 30 …, 2016 | 9 | 2016 |
| Super-pancyclic hypergraphs and bipartite graphs A Kostochka, R Luo, D Zirlin Journal of Combinatorial Theory, Series B 145, 450-465, 2020 | 8 | 2020 |
| Berge cycles in non-uniform hypergraphs Z Furedi, A Kostochka, R Luo arXiv preprint arXiv:2002.01597, 2020 | 6 | 2020 |
| Induced Turán problems and traces of hypergraphs Z Füredi, R Luo European Journal of Combinatorics 111, 103692, 2023 | 4 | 2023 |
| Conditions for a bigraph to be super-cyclic A Kostochka, M Lavrov, R Luo, D Zirlin arXiv preprint arXiv:2006.15730, 2020 | 3 | 2020 |
| A forest building process on simple graphs Z Berikkyzy, S Butler, J Cummings, K Heysse, P Horn, R Luo, B Moran Discrete mathematics 341 (2), 497-507, 2018 | 3 | 2018 |
| Longest cycles in 3‐connected hypergraphs and bipartite graphs A Kostochka, M Lavrov, R Luo, D Zirlin Journal of Graph Theory 99 (4), 758-782, 2022 | 2 | 2022 |
| Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs A Kostochka, R Luo, G McCourt arXiv preprint arXiv:2109.12637, 2021 | 2 | 2021 |
| Large monochromatic components in almost complete graphs and bipartite graphs Z Furedi, R Luo arXiv preprint arXiv:2008.12217, 2020 | 2 | 2020 |
| Forbidding traces in triple systems R Luo, S Spiro arXiv preprint arXiv:2007.01827, 2020 | 2 | 2020 |
