18 citations · 48 across the 33 of their papers we have counts for
5 papers · 1 filter
Separating path systems
Victor Falgas-Ravry, Teeradej Kittipassorn, Dániel Korándi +2
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every -vertex graph admits a separating path system…
Random subcube intersection graphs I: cliques and covering
Victor Falgas-Ravry, Klas Markström
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube to serve as the vertices of the graph,…
On the codegree density of complete 3-graphs and related problems
Victor Falgas-Ravry
Given a family of 3-graphs F its codegree threshold coex(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…
The codegree threshold for 3-graphs with independent neighbourhoods
Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko +1
Given a family of 3-graphs , we define its codegree threshold to be the largest number such that there exists an -vertex 3-graph in which every…
Sperner's problem for G-independent families
Victor Falgas-Ravry
Given a graph G, let Q(G) denote the collection of all independent (edge-free) sets of vertices in G. We consider the problem of determining the size of a largest antichain in Q(G)…