Publications (45)
Fast embedding of spanning trees in biased Maker-Breaker games
Asaf Ferber, Dan Hefetz, Michael Krivelevich
Packing perfect matchings in random hypergraphs
Asaf Ferber, Van Vu
Strong games played on random graphs
Asaf Ferber, Pascal Pfister
Packing, Counting and Covering Hamilton cycles in random directed graphs
Asaf Ferber, Gal Kronenberg, Eoin Long
Building spanning trees quickly in Maker-Breaker games
Dennis Clemens, Asaf Ferber, Roman Glebov +2
Universality of random graphs and rainbow embedding
Asaf Ferber, Rajko Nenadov, Ueli Peter
Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs
Asaf Ferber, Vishesh Jain
Generating random graphs in biased Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Humberto Naves
Random matrices: Law of the iterated logarithm
Asaf Ferber, Daniel Montealegre, Van Vu
On the counting problem in inverse Littlewood--Offord theory
Asaf Ferber, Vishesh Jain, Kyle Luh +1
Supersaturated sparse graphs and hypergraphs
Asaf Ferber, Gweneth Anne McKinley, Wojciech Samotij
Hitting time results for Maker-Breaker games
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz +1
Law of Iterated Logarithm for random graphs
Asaf Ferber, Daniel Montealegre, Van Vu
Packing spanning graphs from separable families
Asaf Ferber, Choongbum Lee, Frank Mousset
1-factorizations of pseudorandom graphs
Asaf Ferber, Vishesh Jain
Counting Hamilton cycles in sparse random directed graphs
Asaf Ferber, Matthew Kwan, Benny Sudakov
Counting and packing Hamilton $\ell$-cycles in dense hypergraphs
Asaf Ferber, Michael Krivelevich, Benny Sudakov
Packing trees of unbounded degrees in random graphs
Asaf Ferber, Wojciech Samotij
Optimal Threshold for a Random Graph to be 2-Universal
Asaf Ferber, Gal Kronenberg, Kyle Luh
Robust hamiltonicity of random directed graphs
Asaf Ferber, Rajko Nenadov, Andreas Noever +2
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
On the number of Hadamard matrices via anti-concentration
Asaf Ferber, Vishesh Jain, Yufei Zhao
Counting Hamilton decompositions of oriented graphs
Asaf Ferber, Eoin Long, Benny Sudakov
Finding Hamilton cycles in random graphs with few queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
Packing a randomly edge-colored random graph with rainbow $k$-outs
Asaf Ferber, Gal Kronenberg, Frank Mousset +1
Towards the linear arboricity conjecture
Asaf Ferber, Jacob Fox, Vishesh Jain
Rainbow Hamilton cycles in random graphs and hypergraphs
Asaf Ferber, Michael Krivelevich
Almost-spanning universality in random graphs
David Conlon, Asaf Ferber, Rajko Nenadov +1
Number of 1-factorizations of regular high-degree graphs
Asaf Ferber, Vishesh Jain, Benny Sudakov
Long monotone trails in random edge-labelings of random graphs
Omer Angel, Asaf Ferber, Benny Sudakov +1
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
Asaf Ferber
Efficient winning strategies in random-turn Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Gal Kronenberg
Biased Games On Random Boards
Asaf Ferber, Roman Glebov, Michael Krivelevich +1
Avoider-Enforcer games played on edge disjoint hypergraphs
Asaf Ferber, Michael Krivelevich, Alon Naor
Packing and counting arbitrary Hamilton cycles in random digraphs
Asaf Ferber, Eoin Long
Fast strategies in Maker-Breaker games played on random boards
Dennis Clemens, Asaf Ferber, Michael Krivelevich +1
A construction of almost Steiner systems
Asaf Ferber, Rani Hod, Michael Krivelevich +1
Finding paths in sparse random graphs requires many queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
Embedding large graphs into a random graph
Asaf Ferber, Kyle Luh, Oanh Nguyen
Packing Loose Hamilton Cycles
Asaf Ferber, Kyle Luh, Daniel Montealegre +1
Spanning universality in random graphs
Asaf Ferber, Rajko Nenadov
Counting and packing Hamilton cycles in dense graphs and oriented graphs
Asaf Ferber, Michael Krivelevich, Benny Sudakov
Weak and Strong k-connectivity games
Asaf Ferber, Dan Hefetz
Resilience for the Littlewood-Offord Problem
Afonso S. Bandeira, Asaf Ferber, Matthew Kwan
On a Conjecture of Thomassen
Michelle Delcourt, Asaf Ferber