Victor Falgas-ravry

activity

20112026

most citedGlobal Structural Properties of Random Graphs

18 citations · 48 across the 33 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

math.CO2019

Existence thresholds and Ramsey properties of random posets

Victor Falgas-Ravry, Klas Markström, Andrew Treglown +1

Let $P (n)$ denote the power set of $[n]$ , ordered by inclusion, and let $P (n, p)$ denote the random poset obtained from $P (n)$ by retaining each element…

math.PR2019

Long paths and connectivity in { $1$ }-independent random graphs

A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock

Given a graph $G$ , a probability measure $μ$ on the subsets of the edge set of $G$ is said to be $1$ -independent if events determined by edge sets that are at graph distance at lea…

math.CO2019

Maker-Breaker Percolation Games II: Escaping to Infinity

A. Nicholas Day, Victor Falgas-Ravry

Let $Λ$ be an infinite connected graph, and let $v_{0}$ be a vertex of $Λ$ . We consider the following positional game. Two players, Maker and Breaker, play in alternating turns. Init…

math.CO2019

Triangle-degrees in graphs and tetrahedron coverings in 3-graphs

Victor Falgas--Ravry, Klas Markström, Yi Zhao

We investigate a covering problem in $3$ -uniform hypergraphs ( $3$ -graphs): given a $3$ -graph $F$ , what is $c_{1} (n, F)$ , the least integer $d$ such that if $G$ is an $n$ -vertex $3$ -gr…

Existence thresholds and Ramsey properties of random posets

Long paths and connectivity in {1}-independent random graphs

Maker-Breaker Percolation Games II: Escaping to Infinity

Triangle-degrees in graphs and tetrahedron coverings in 3-graphs

Long paths and connectivity in { $1$ }-independent random graphs