asaf ferber
asaf ferber
Assistant Professor, UCI
Verified email at - Homepage
Cited by
Cited by
Hitting time results for Maker‐Breaker games
S Ben‐Shimon, A Ferber, D Hefetz, M Krivelevich
Random Structures & Algorithms 41 (1), 23-46, 2012
On the counting problem in inverse Littlewood–Offord theory
A Ferber, V Jain, K Luh, W Samotij
Journal of the London Mathematical Society 103 (4), 1333-1362, 2021
Rainbow Hamilton cycles in random graphs and hypergraphs
A Ferber, M Krivelevich
Recent trends in combinatorics, 167-189, 2016
Lower bounds for multicolor Ramsey numbers
D Conlon, A Ferber
Advances in Mathematics 378, 107528, 2021
Supersaturated sparse graphs and hypergraphs
A Ferber, G McKinley, W Samotij
International Mathematics Research Notices 2020 (2), 378-402, 2020
Singularity of random symmetric matrices—a combinatorial approach to improved bounds
A Ferber, V Jain
Forum of Mathematics, Sigma 7, e22, 2019
Fast strategies in Maker–Breaker games played on random boards
D Clemens, A Ferber, M Krivelevich, A Liebenau
Combinatorics, Probability and Computing 21 (6), 897-915, 2012
Robust Hamiltonicity of random directed graphs
A Ferber, R Nenadov, A Noever, U Peter, N Škorić
Journal of Combinatorial Theory, Series B 126, 1-23, 2017
Counting and packing Hamilton cycles in dense graphs and oriented graphs
A Ferber, M Krivelevich, B Sudakov
Journal of Combinatorial Theory, Series B 122, 196-220, 2017
Winning strong games through fast strategies for weak games
A Ferber, D Hefetz
the electronic journal of combinatorics, P144-P144, 2011
Biased games on random boards
A Ferber, R Glebov, M Krivelevich, A Naor
Random Structures & Algorithms 46 (4), 651-676, 2015
Optimal threshold for a random graph to be 2-universal
A Ferber, G Kronenberg, K Luh
Transactions of the American mathematical Society 372 (6), 4239-4262, 2019
Universality of random graphs and rainbow embedding
A Ferber, R Nenadov, U Peter
Random Structures & Algorithms 48 (3), 546-564, 2016
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
A Ferber
arXiv preprint arXiv:1502.01399, 2015
Packing spanning graphs from separable families
A Ferber, C Lee, F Mousset
Israel Journal of Mathematics 219, 959-982, 2017
Almost all Steiner triple systems are almost resolvable
A Ferber, M Kwan
Forum of Mathematics, Sigma 8, e39, 2020
Packing trees of unbounded degrees in random graphs
A Ferber, W Samotij
Journal of the London Mathematical Society 99 (3), 653-677, 2019
Finding Hamilton cycles in random graphs with few queries
A Ferber, M Krivelevich, B Sudakov, P Vieira
Random Structures & Algorithms 49 (4), 635-668, 2016
Generating random graphs in biased Maker‐Breaker games
A Ferber, M Krivelevich, H Naves
Random Structures & Algorithms 47 (4), 615-634, 2015
Almost‐spanning universality in random graphs
D Conlon, A Ferber, R Nenadov, N Škorić
Random Structures & Algorithms 50 (3), 380-393, 2017
The system can't perform the operation now. Try again later.
Articles 1–20