| On the size‐Ramsey number of hypergraphs A Dudek, SL Fleur, D Mubayi, V Rödl Journal of Graph Theory 86 (1), 104-121, 2017 | 19 | 2017 |
| 3-Connected {K 1,3, P 9}-Free Graphs are Hamiltonian-Connected Q Bian, RJ Gould, P Horn, S Janiszewski, S La Fleur, P Wrayno Graphs and Combinatorics 30, 1099-1122, 2014 | 11 | 2014 |
| A note on induced Ramsey numbers D Conlon, D Dellamonica, S La Fleur, V Rödl, M Schacht A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, 357-366, 2017 | 4 | 2017 |
| On induced Ramsey numbers for k‐uniform hypergraphs D Dellamonica Jr, S La Fleur, V Rödl Random Structures & Algorithms 48 (1), 5-20, 2016 | | 2016 |
| On Problems in Extremal Graph Theory and Ramsey Theory SJ La Fleur | | 2013 |
| Jumps and Nonjumps in Multigraphs P Horn, S La Fleur, V Rödl SIAM Journal on Discrete Mathematics 27 (2), 1040-1054, 2013 | | 2013 |
| ON OFF-DIAGONAL RAMSEY AND INDUCED RAMSEY NUMBERS FOR k-UNIFORM HYPERGRAPHS D DELLAMONICA JR, S LA FLEUR, V RÖDL | | |
