Asaf Ferber

According to our database1, Asaf Ferber authored at least 37 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
1-Factorizations of pseudorandom graphs.
Random Struct. Algorithms, 2020

Towards the linear arboricity conjecture.
J. Comb. Theory, Ser. B, 2020

Long Monotone Trails in Random Edge-Labellings of Random Graphs.
Comb. Probab. Comput., 2020

Co-degrees Resilience for Perfect Matchings in Random Hypergraphs.
Electron. J. Comb., 2020

Number of 1-Factorizations of Regular High-Degree Graphs.
Comb., 2020

2019
Law of the iterated logarithm for random graphs.
Random Struct. Algorithms, 2019

Packing and counting arbitrary Hamilton cycles in random digraphs.
Random Struct. Algorithms, 2019

Packing trees of unbounded degrees in random graphs.
J. Lond. Math. Soc., 2019

2018
Packing perfect matchings in random hypergraphs.
Random Struct. Algorithms, 2018

Spanning universality in random graphs.
Random Struct. Algorithms, 2018

Counting Hamilton cycles in sparse random directed graphs.
Random Struct. Algorithms, 2018

2017
Finding paths in sparse random graphs requires many queries.
Random Struct. Algorithms, 2017

Almost-spanning universality in random graphs.
Random Struct. Algorithms, 2017

Efficient Winning Strategies in Random-Turn Maker-Breaker Games.
J. Graph Theory, 2017

Robust Hamiltonicity of random directed graphs.
J. Comb. Theory, Ser. B, 2017

Counting and packing Hamilton cycles in dense graphs and oriented graphs.
J. Comb. Theory, Ser. B, 2017

Resilience for the Littlewood-Offord Problem.
Electron. Notes Discret. Math., 2017

Packing Loose Hamilton Cycles.
Comb. Probab. Comput., 2017

Strong Games Played on Random Graphs.
Electron. J. Comb., 2017

2016
Universality of random graphs and rainbow embedding.
Random Struct. Algorithms, 2016

Finding Hamilton cycles in random graphs with few queries.
Random Struct. Algorithms, 2016

2015
Building Spanning Trees Quickly in Maker-Breaker Games.
SIAM J. Discret. Math., 2015

Generating random graphs in biased Maker-Breaker games.
Random Struct. Algorithms, 2015

Biased games on random boards.
Random Struct. Algorithms, 2015

Packing, Counting and Covering Hamilton cycles in random directed graphs.
Electron. Notes Discret. Math., 2015

Almost-spanning universality in random graphs (Extended abstract).
Electron. Notes Discret. Math., 2015

Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs.
Electron. J. Comb., 2015

On a Conjecture of Thomassen.
Electron. J. Comb., 2015

Robust hamiltonicity of random directed graphs <i>extended abstract</i>.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Weak and strong <i>k</i>k-connectivity games.
Eur. J. Comb., 2014

2013
Avoider-Enforcer games played on edge disjoint hypergraphs.
Discret. Math., 2013

The Biased Odd Cycle Game.
Electron. J. Comb., 2013

2012
Hitting time results for Maker-Breaker games.
Random Struct. Algorithms, 2012

Fast Strategies In Maker-Breaker Games Played on Random Boards.
Comb. Probab. Comput., 2012

2011
Fast embedding of spanning trees in biased Maker-Breaker games.
Electron. Notes Discret. Math., 2011

Winning Strong Games through Fast Strategies for Weak Games.
Electron. J. Comb., 2011

2010
On almost precipitous ideals.
Arch. Math. Log., 2010


  Loading...