35 citations · 146 across the 49 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Supersaturated sparse graphs and hypergraphs
Asaf Ferber, Gweneth Anne McKinley, Wojciech Samotij
A central problem in extremal graph theory is to estimate, for a given graph , the number of -free graphs on a given set of vertices. In the case when is not bipartit…
math.CO2017
Counting Hamilton cycles in sparse random directed graphs
Asaf Ferber, Matthew Kwan, Benny Sudakov
Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that i…
math.CO2017
Spanning universality in random graphs
Asaf Ferber, Rajko Nenadov
A graph is said to be -universal if it contains every graph on vertices with maximum degree at most . Using a `matching-based' embedding technique introdu…