Follow
Victor Falgas-Ravry
Victor Falgas-Ravry
Institutionen för matematik och matematisk statistik, Umeå Universitet
Verified email at math.umu.se - Homepage
Title
Cited by
Cited by
Year
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
78*2013
Turán H-Densities for 3-Graphs
V Falgas-Ravry, ER Vaughan
The Electronic Journal of Combinatorics 19 (3), P40, 2012
332012
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
272015
Global structural properties of random graphs
J Behrstock, V Falgas-Ravry, MF Hagen, T Susse
International mathematics research notices 2018 (5), 1411-1441, 2018
202018
The codegree threshold of K_4^-
V Falgas‐Ravry, O Pikhurko, E Vaughan, J Volec
Journal of the London Mathematical Society, 0
19*
Separating path systems
V Falgas-Ravry, T Kittipassorn, D Korándi, S Letzter, BP Narayanan
Journal of Combinatorics 5 (3), 335--354, 2014
142014
Minimal weight in union-closed families
V Falgas-Ravry
The Electronic Journal of Combinatorics 18 (1), P95, 2011
132011
On the codegree density of complete 3-graphs and related problems
V Falgas-Ravry
The Electronic Journal of Combinatorics 20 (4), Paper 28, 2013
122013
Codegree thresholds for covering 3-uniform hypergraphs
V Falgas-Ravry, Y Zhao
SIAM Journal on Discrete Mathematics 30 (4), 1899--1917, 2016
112016
Sharpness in the k-nearest-neighbours random geometric graph model
V Falgas-Ravry, M Walters
Advances in Applied Probability 44 (3), 617-634, 2012
102012
Maker-breaker percolation games II: Escaping to infinity
AN Day, V Falgas–Ravry
Journal of Combinatorial Theory, Series B 151, 482-508, 2021
82021
Maker–Breaker percolation games I: crossing grids
AN Day, V Falgas-Ravry
Combinatorics, Probability and Computing 30 (2), 200-227, 2021
82021
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
82020
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
8*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
82019
Long paths and connectivity in 1‐independent random graphs
AN Day, V Falgas‐Ravry, R Hancock
Random Structures & Algorithms 57 (4), 1007-1049, 2020
62020
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
V Falgas-Ravry, K Markström, E Räty
arXiv preprint arXiv:2212.07180, 2022
42022
Extremal problems for multigraphs
AN Day, V Falgas-Ravry, A Treglown
Journal of Combinatorial Theory, Series B 154, 1-48, 2022
42022
1‐independent percolation on ℤ^2×K_n
V Falgas‐Ravry, V Pfenninger
Random Structures & Algorithms, 2022
42022
The system can't perform the operation now. Try again later.
Articles 1–20