35 citations · 146 across the 49 of their papers we have counts for
7 papers · 2 filters
Packing spanning graphs from separable families
Asaf Ferber, Choongbum Lee, Frank Mousset
Let be a separable family of graphs. Then for all positive constants and and for every sufficiently large integer , every sequence $G_1,\dotsc,G_t\in\mathca…
Rainbow Hamilton cycles in random graphs and hypergraphs
Asaf Ferber, Michael Krivelevich
Let be an edge colored hypergraph. We say that contains a \emph{rainbow} copy of a hypergraph if it contains an isomorphic copy of with all edges of distinct colors…
Packing, Counting and Covering Hamilton cycles in random directed graphs
Asaf Ferber, Gal Kronenberg, Eoin Long
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in dire…
Finding paths in sparse random graphs requires many queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\s…
Finding Hamilton cycles in random graphs with few queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\mat…
Almost-spanning universality in random graphs
David Conlon, Asaf Ferber, Rajko Nenadov +1
A graph is said to be -universal if it contains every graph on vertices with maximum degree at most . It is known that for any and any…
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
Asaf Ferber
We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph a…