16 citations · 33 across the 19 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Optimal Threshold for a Random Graph to be 2-Universal
Asaf Ferber, Gal Kronenberg, Kyle Luh
For a family of graphs , a graph is -universal if contains every graph in as a (not necessarily induced) subgraph. For the family of…
math.CO2016
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
We use a theorem by Ding, Lubetzky and Peres describing the structure of the giant component of random graphs in the strictly supercritical regime, in order to determine the typica…