18 citations · 48 across the 33 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Codegree thresholds for covering 3-uniform hypergraphs
Victor Falgas-Ravry, Yi Zhao
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 pai…
math.CO2015
Full subgraphs
Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte
Let be a graph of density on vertices. Following Erdős, Łuczak and Spencer, an -vertex subgraph of is called {\em full} if has minimum degree at le…
math.PR2015★ 18 cited
Global Structural Properties of Random Graphs
Jason Behrstock, Victor Falgas-Ravry, Mark F. Hagen +1
We study two global structural properties of a graph , denoted AS and CFS, which arise in a natural way from geometric group theory. We study these properties in the Erdös--Rény…