1 citations · 1 across the 4 of their papers we have counts for
8 papers
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…
Square percolation and the threshold for quadratic divergence in random right-angled Coxeter groups
Jason Behrstock, Victor Falgas-Ravry, Tim Susse
Given a graph , its auxiliary \emph{square-graph} is the graph whose vertices are the non-edges of and whose edges are the pairs of non-edges which induce a squ…
Existence thresholds and Ramsey properties of random posets
Victor Falgas-Ravry, Klas Markström, Andrew Treglown +1
Let denote the power set of , ordered by inclusion, and let denote the random poset obtained from by retaining each element…
Long paths and connectivity in {}-independent random graphs
A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock
Given a graph , a probability measure on the subsets of the edge set of is said to be -independent if events determined by edge sets that are at graph distance at lea…
Maker-Breaker Percolation Games II: Escaping to Infinity
A. Nicholas Day, Victor Falgas-Ravry
Let be an infinite connected graph, and let be a vertex of . We consider the following positional game. Two players, Maker and Breaker, play in alternating turns. Init…
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Victor Falgas--Ravry, Klas Markström, Yi Zhao
We investigate a covering problem in -uniform hypergraphs (-graphs): given a -graph , what is , the least integer such that if is an -vertex -gr…