| How many random edges make a dense graph Hamiltonian? T Bohman, A Frieze, R Martin Random Structures & Algorithms 22 (1), 33-42, 2003 | 133 | 2003 |
| Codes identifying sets of vertices in random networks A Frieze, R Martin, J Moncel, M Ruszinkó, C Smyth Discrete Mathematics 307 (9-10), 1094-1107, 2007 | 60 | 2007 |
| Adding random edges to dense graphs T Bohman, A Frieze, M Krivelevich, R Martin Random Structures & Algorithms 24 (2), 105-117, 2004 | 60 | 2004 |
| On the editing distance of graphs M Axenovich, A Kézdy, R Martin Journal of Graph Theory 58 (2), 123-138, 2008 | 52 | 2008 |
| Planar Turán number of the 6-cycle D Ghosh, E Gyori, RR Martin, A Paulos, C Xiao SIAM Journal on Discrete Mathematics 36 (3), 2028-2050, 2022 | 51 | 2022 |
| The emergence of a giant component in random subgraphs of pseudo‐random graphs A Frieze, M Krivelevich, R Martin Random Structures & Algorithms 24 (1), 42-50, 2004 | 51 | 2004 |
| On diamond-free subposets of the Boolean lattice L Kramer, RR Martin, M Young Journal of Combinatorial Theory, Series A 120 (3), 545-560, 2013 | 43 | 2013 |
| Quadripartite version of the Hajnal–Szemerédi theorem R Martin, E Szemerédi Discrete mathematics 308 (19), 4337-4360, 2008 | 42 | 2008 |
| Induced and non-induced poset saturation problems B Keszegh, N Lemons, RR Martin, D Pálvölgyi, B Patkós Journal of Combinatorial Theory, Series A 184, 105497, 2021 | 37 | 2021 |
| The saturation number of induced subposets of the Boolean lattice M Ferrara, B Kay, L Kramer, RR Martin, B Reiniger, HC Smith, E Sullivan Discrete Mathematics 340 (10), 2479-2487, 2017 | 37 | 2017 |
| Tripartite version of the Corrádi–Hajnal theorem C Magyar, RR Martin Discrete mathematics 254 (1-3), 289-308, 2002 | 36 | 2002 |
| Rainbow arithmetic progressions S Butler, C Erickson, L Hogben, K Hogenson, L Kramer, RL Kramer, ... arXiv preprint arXiv:1404.7232, 2014 | 34 | 2014 |
| Expected values of parameters associated with the minimum rank of a graph HT Hall, L Hogben, R Martin, B Shader Linear Algebra and its Applications 433 (1), 101-117, 2010 | 32 | 2010 |
| Q2-free Families in the Boolean Lattice M Axenovich, J Manske, R Martin Order 29 (1), 177-191, 2012 | 31 | 2012 |
| The diameter game J Balogh, R Martin, A Pluhár Random Structures & Algorithms 35 (3), 369-389, 2009 | 29 | 2009 |
| Counting paths, cycles, and blow‐ups in planar graphs C Cox, RR Martin Journal of Graph Theory 101 (3), 521-558, 2022 | 26 | 2022 |
| On the path separation number of graphs J Balogh, B Csaba, RR Martin, A Pluhár Discrete Applied Mathematics 213, 26-33, 2016 | 26 | 2016 |
| On the complexity of Chooser-Picker positional games A Csernenszky, RR Martin, A Pluhár arXiv preprint arXiv:1605.05430, 2016 | 26 | 2016 |
| Induced saturation number RR Martin, JJ Smith Discrete Mathematics 312 (21), 3096-3106, 2012 | 25 | 2012 |
| A note on short cycles in a hypercube M Axenovich, R Martin Discrete mathematics 306 (18), 2212-2218, 2006 | 24 | 2006 |
Alan FriezeCarnegie Mellon UniversityVerified email at random.math.cmu.edu
