| Applications of the semi-definite method to the Turán density problem for 3-graphs V Falgas-Ravry, ER Vaughan Combinatorics, Probability and Computing 22 (1), 21-54, 2013 | 81* | 2013 |
| Turán H-Densities for 3-Graphs V Falgas-Ravry, ER Vaughan The Electronic Journal of Combinatorics 19 (3), P40, 2012 | 33 | 2012 |
| Multicolor containers, extremal entropy, and counting V Falgas‐Ravry, K O'Connell, A Uzzell Random Structures & Algorithms 54 (4), 676-720, 2019 | 29* | 2019 |
| The codegree threshold for 3-graphs with independent neighborhoods V Falgas--Ravry, E Marchant, O Pikhurko, ER Vaughan SIAM Journal on Discrete Mathematics 29 (3), 1504-1539, 2015 | 28 | 2015 |
| Global structural properties of random graphs J Behrstock, V Falgas-Ravry, MF Hagen, T Susse International mathematics research notices 2018 (5), 1411-1441, 2018 | 19 | 2018 |
| The codegree threshold of K_4^- V Falgas‐Ravry, O Pikhurko, E Vaughan, J Volec Journal of the London Mathematical Society, 0 | 17* | |
| On the codegree density of complete 3-graphs and related problems V Falgas-Ravry The Electronic Journal of Combinatorics 20 (4), Paper 28, 2013 | 14 | 2013 |
| Minimal weight in union-closed families V Falgas-Ravry The Electronic Journal of Combinatorics 18 (1), P95, 2011 | 14 | 2011 |
| Codegree thresholds for covering 3-uniform hypergraphs V Falgas-Ravry, Y Zhao SIAM Journal on Discrete Mathematics 30 (4), 1899--1917, 2016 | 10 | 2016 |
| Separating path systems V Falgas-Ravry, T Kittipassorn, D Korándi, S Letzter, BP Narayanan Journal of Combinatorics 5 (3), 335--354, 2014 | 10 | 2014 |
| Sharpness in the k-nearest-neighbours random geometric graph model V Falgas-Ravry, M Walters Advances in Applied Probability 44 (3), 617-634, 2012 | 10 | 2012 |
| Maker-breaker percolation games II: Escaping to infinity AN Day, V Falgas–Ravry Journal of Combinatorial Theory, Series B 151, 482-508, 2021 | 8 | 2021 |
| Maker–Breaker percolation games I: crossing grids AN Day, V Falgas-Ravry Combinatorics, Probability and Computing 30 (2), 200-227, 2021 | 8 | 2021 |
| Long paths and connectivity in 1‐independent random graphs AN Day, V Falgas‐Ravry, R Hancock Random Structures & Algorithms 57 (4), 1007-1049, 2020 | 7 | 2020 |
| Speed and concentration of the covering time for structured coupon collectors V Falgas-Ravry, J Larsson, K Markström Advances in Applied Probability 52 (2), 433-462, 2020 | 7* | 2020 |
| Triangle-degrees in graphs and tetrahedron coverings in 3-graphs V Falgas-Ravry, K Markström, Y Zhao https://arxiv.org/abs/1901.09560, 2019 | 7 | 2019 |
| Existence thresholds and Ramsey properties of random posets V Falgas‐Ravry, K Markström, A Treglown, Y Zhao Random Structures & Algorithms 57 (4), 1097-1133, 2020 | 6 | 2020 |
| Thresholds in probabilistic and extremal combinatorics. V Falgas-Ravry Queen Mary University of London, 2012 | 6 | 2012 |
| Extremal problems for multigraphs AN Day, V Falgas-Ravry, A Treglown Journal of Combinatorial Theory, Series B 154, 1-48, 2022 | 4 | 2022 |
| On an extremal problem for locally sparse multigraphs V Falgas-Ravry European Journal of Combinatorics 118, 103887, 2024 | 3 | 2024 |
Klas MarkströmInstitutionen för Matematik och Matematisk statistik, Umeĺ universitetVerified email at umu.se
