35 citations · 146 across the 49 of their papers we have counts for
5 papers · 1 filter
Robust hamiltonicity of random directed graphs
Asaf Ferber, Rajko Nenadov, Andreas Noever +2
In his seminal paper from 1952 Dirac showed that the complete graph on vertices remains Hamiltonian even if we allow an adversary to remove edges tou…
Packing a randomly edge-colored random graph with rainbow -outs
Asaf Ferber, Gal Kronenberg, Frank Mousset +1
Let be a graph on vertices and let be a fixed positive integer. We denote by $\mathcal G_{\text{$k$-out}}(G)$ the probability space consisting of subgraphs of where…
On a Conjecture of Thomassen
Michelle Delcourt, Asaf Ferber
In 1989, Thomassen asked whether there is an integer-valued function f(k) such that every f(k)-connected graph admits a spanning, bipartite -connected subgraph. In this paper we…
Efficient winning strategies in random-turn Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Gal Kronenberg
We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007. A -random-turn positional game is a two-player game, played the same as an…
Counting and packing Hamilton -cycles in dense hypergraphs
Asaf Ferber, Michael Krivelevich, Benny Sudakov
We consider problems about packing and counting Hamilton -cycles in hypergraphs of large minimum degree. Given a hypergraph , for a -subset $A\subseteq V(\math…