Victor Falgas-Ravry

Learn More
Given a family of 3-graphs F, we define its codegree threshold coex(n, F) to be the largest number d = d(n) such that there exists an n-vertex 3-graph in which every pair of vertices is contained in at least d 3-edges but which contains no member of F as a subgraph. Let F 3,2 be the 3-graph on {a, b, c, d, e} with 3-edges abc, abd, abe and cde. In this(More)
Given a 3-graph F , its codegree threshold co-ex(n, F) is the largest number d = d(n) such that there exists an n-vertex 3-graph in which every pair of vertices is contained in at least d triples but which contains no member of F as a subgraph. The limit γ(F) = lim n→∞ co-ex(n, F) n − 2 is known to exist and is called the codegree density of F. In this(More)
Let V be an n-set, and let X be a random variable taking values in the powerset of V. Suppose we are given a sequence of random coupons X 1 , X 2 ,. . ., where the X i are independent random variables with distribution given by X. The covering time T is the smallest integer t ≥ 0 such that t i=1 X i = V. The distribution of T is important in many(More)
In recent breakthrough results, Saxton–Thomason and Balogh–Morris–Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of new results on transference, and on counting and characterising typical graphs in hereditary properties. In a different direction, Hatami–Janson–Szegedy proved results on the(More)
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube Q d to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is non-empty. Our motivation for considering such graphs is to model 'random compatibility' between vertices in(More)
Given two 3-uniform hypergraphs F and G, we say that G has an F-covering if we can cover V (G) by copies of F. The minimum codegree of G is the largest integer d such that every pair of vertices from V (G) is contained in at least d triples from E(G). Define c 2 (n, F) to be the largest minimum codegree among all n-vertex 3-graphs G that contain no(More)