18 citations · 48 across the 33 of their papers we have counts for
5 papers · 1 filter
The codegree threshold of
Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan +1
The codegree threshold of a -graph is the minimum such that every -graph on vertices in which every pair of vertices is contained in at…
Bootstrap percolation in random geometric graphs
Victor Falgas-Ravry, Amites Sarkar
Following Bradonjić and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the -dimensional torus. In this model, the expected number of…
Rectilinear approximation and volume estimates for hereditary bodies via [0,1]-decorated containers
Victor Falgas-Ravry, Robert Hancock, Johanna Strömberg +1
We use the hypergraph container theory of Balogh--Morris--Samotij and Saxton--Thomason to obtain general rectilinear approximations and volume estimates for sequences of bodies clo…
-independent percolation on
Victor Falgas-Ravry, Vincent Pfenninger
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independ…
On an extremal problem for locally sparse multigraphs
Victor Falgas-Ravry
A multigraph is an -graph if every -set of vertices in supports at most edges of , counting multiplicities. Mubayi and Terry posed the problem of determini…