26 citations · 91 across the 20 of their papers we have counts for
Showing 2016 · math.COShow all
3 papers · 2 filters
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
Packing Loose Hamilton Cycles
Asaf Ferber, Kyle Luh, Daniel Montealegre +1
A subset of edges in a -uniform hypergraph is a \emph{loose Hamilton cycle} if covers all the vertices of and there exists a cyclic ordering of these vertices su…
math.CO2016★ 6 cited
Embedding large graphs into a random graph
Asaf Ferber, Kyle Luh, Oanh Nguyen
In this paper we consider the problem of embedding almost-spanning, bounded degree graphs in a random graph. In particular, let , and let be a graph…