Jumps and Nonjumps in Multigraphs. - Paul Horn; Steve La Fleur; Vojtech Rödl (SIAM J. Discret. Math., 2013)

3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. - Qiuju Bian; Ronald J. Gould; Paul Horn; Susan Janiszewski; Steve La Fleur; Paul Wrayno (Graphs Comb., 2014)

On induced Ramsey numbers for k-uniform hypergraphs. - Domingos Dellamonica Jr.; Steve La Fleur; Vojtech Rödl (Random Struct. Algorithms, 2016)

On the Size-Ramsey Number of Hypergraphs. - Andrzej Dudek; Steve La Fleur; Dhruv Mubayi; Vojtech Rödl (J. Graph Theory, 2017)