Papers and notes

Selected publications:

  1. Supersaturated sparse graphs and hypergraphs, joint with Gweneth McKinley and Wojtek Samotij, International Mathematics Research Notices.
  2. Counting Hamilton decomposition in oriented graphs, joint with Eoin Long and Benny Sudakov, International Mathematics Research Notices.
  3. Packing perfect matchings in random hypergraphs, joint with Van Vu, to appear in Random Structures and Algorithms.
  4. Embedding large graphs into a random graph, joint with Kyle Luh and Oanh Nguyen, Bulletin of the London Mathematical Society,  49 (5), 784-797
  5. Resilience for the Littlewood-Offord problem, joint with Afonso S. Bandeira and Matthew Kwan, Advances in Mathematics, 319 (2017), 292-312.
  6. Packing bounded-degree spanning graphs from separable families, joint with Choongbum Lee and Frank Mousset, Israel Journal of Mathematics,  219 (2), (2017), 959-982.
  7. Packing, Counting and Covering Hamilton cycles in random directed graphs, joint with Gal Kronenberg and Eoin Long, Israel Journal of Mathematics,  220 (1) (2017), 57-87.
  8. Packing spanning trees in random graphs, joint with Wojtek Samotij, to appear in Journal of the London Mathematical Society.
  9. Number of 1-factorizations of regular high degree graphs, joint with Vishesh Jain and Benny Sudakov.
  10. 1-factorizations of pseudorandom graphs, joint with Vishesh Jain, an extended abstract has been accepted to FOCS ‘18

 

All publications:

Preprints

  1. Resilience for perfect matchings in random hypergraphs, joint with Lior Hirschfeld.
  2. Number of 1-factorizations of regular high degree graphs, joint with Vishesh Jain and Benny Sudakov.
  3. On the linear arboricity of graphs, joint with Jacob Fox and Vishesh Jain.
  4. On problems in discrete random matrices, joint with Kyle Luh, Gweneth McKinley and Wojtek Samotij.
  5. Counting Hamilton cycles in sparse random directed graphs, joint with Matthew Kwan and Benny Sudakov.
  6. Optimal Threshold for a Random Graph to be 2-Universal, joint with Gal Kronenberg and Kyle Luh, submitted.
  7. Random Matrices: Law of Iterated Logarithm, joint with Daniel Montealegre and Van Vu, submitted.

To appear

  1. 1-factorizations of pseudorandom graphs, joint with Vishesh Jain, to appear in FOCS ’18.
  2. Spanning universality in random graphs, joint with Rajko Nenadov, to appear in Random Structures and Algorithms.
  3. Packing spanning trees in random graphs, joint with Wojtek Samotij, to appear in Journal of the London Mathematical Society.
  4. Supersaturated sparse graphs and hypergraphs, joint with Gweneth McKinley and Wojtek Samotij, International Mathematics Research Notices.
  5. Packing and Counting arbitrary Hamilton cycles in random directed graphs, joint with Eoin Long, to appear in Random Structures and Algorithms.
  6. Counting Hamilton decomposition in oriented graphs, joint with Eoin Long and Benny Sudakov, International Mathematics Research Notices.
  7. Law of Iterated Logarithm for random graphs, joint with Daniel Montealegre and Van Vu, Random Structures and Algorithms.
  8. Random turn games, joint with Michael Krivelevich and Gal Kronenberg, to appear in the Electronic Journal of Combinatorics.

2017

  1. Packing perfect matchings in random hypergraphs, joint with Van Vu, Random Structures and Algorithms, 52 (3).
  2. Packing loose Hamilton cycles in random hypergraphs, joint with Kyle Luh, Daniel Montealegre and Oanh Nguyen, Combinatorics, Probability and Computing, 26 (6), 839-849.
  3. Embedding large graphs into a random graph, joint with Kyle Luh and Oanh Nguyen, Bulletin of the London Mathematical Society,  49 (5), 784-797
  4. Resilience for the Littlewood-Offord problem, joint with Afonso S. Bandeira and Matthew Kwan, Advances in Mathematics, 319 (2017), 292-312.
  5. Packing bounded-degree spanning graphs from separable families, joint with Choongbum Lee and Frank Mousset, Israel Journal of Mathematics,  219 (2), (2017), 959-982.
  6. Packing, Counting and Covering Hamilton cycles in random directed graphs, joint with Gal Kronenberg and Eoin Long, Israel Journal of Mathematics,  220 (1) (2017), 57-87
  7. Counting and packing Hamilton cycles in dense graphs and oriented graphs, joint with Michael Krivelevich and Benny Sudakov, Journal of Combinatorial Theory Series B 122 (2017), 196-220. 
  8. Finding paths in sparse random graphs requires many queries, joint with Michael Krivelevich, Benny Sudakov and Pedro Vieira, Random Structures and Algorithms 50 (2017), 71-85.
  9. Strong games played on random graphs, joint with Pascal Pfister,
    The Electronic Journal of Combinatorics, Volume 24, Issue 1, 2017.
     
  10. Almost-spanning universality in random graphs, joint with David Conlon, Rajko Nenadov and Nemanja Skoric, Random Structures and Algorithms, 50 (3), 380-393.

2016 

  1. Finding Hamilton cycles in random graphs with few queries, joint with Michael Krivelevich, Benny Sudakov and Pedro Vieira, Random Structures and Algorithms 49 (2016), 535-668.
  2. Rainbow Hamilton cycles in random graphs and hypergraphs, joint with Michael Krivelevich, Recent trends in combinatorics, IMA Volumes in Mathematics and its applications, A. Beveridge, J. R. Griggs, L. Hogben, G. Musiker and P. Tetali, Eds., Springer 2016, 167-189.
  3. Counting and packing Hamilton l-cycles in dense hypergraphs, joint with Michael Krivelevich and Benny Sudakov, Journal of Combinatorics, 7 (2016), 135-157. 
  4. Universality of random graphs and rainbow embedding, joint with Rajko Nenadov and Ueli Peter, Random Structures and Algorithms 48 (2016), 546-564.

2015

  1. Building spanning trees quickly in Maker-Breaker games, joint with Dennis Clemens, Roman Glebov, Dan Hefetz and Anita Liebenau, SIDMA, 29 (3) (2015) , 1683-1705.
  2. Generating random graphs in biased Maker-Breaker games, joint with Michael Krivelevich and Humberto Naves, Random Structures and Algorithms, 47 (2015), 615-634.
  3. Biased Maker-Breaker games played on random boards, joint with Roman Glebov, Michael Krivelevich and Alon Naor, Random Structures and Algorithms, 46 (2015), 651-676. 
  4. Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs, Electronic Journal of Combinatorics, Vol. 21, Issue 2 (2015), P1.61.
  5. Robust hamiltonicity of random directed graphs, joint with Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric, Journal of Combinatorial Theory Series B, also appeared at SODA'15. 
  6. On a conjecture of Thomassen, joint with Michelle Delcourt, Electronic Journal of Combinatorics, Volume 22, Issue 3.

2014

  1. Weak and strong k-connectivity games, joint with Dan Hefetz, European Journal of Combinatorics (2014), pp. 169-183.
  2. A construction of almost Steiner systems, joint with Rani Hod, Michael Krivelevich and Benny Sudakov, Journal of Combinatorial Designs (2014), Volume 22 (11), 488-494.

 

2013

  1. Avoider-Enforcer games played on edge disjoint hypergraphs, joint with Michael Krivelevich and Alon Naor, Discrete Mathematics, 313 (2013), pp. 2932-2941.
  2. The biased odd cycle game, joint with Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomas Valla and Mate Vizer Electronic Journal of Combinatorics Vol. 20, Issue 2 (2013), publ. P9.

2012

  1. Fast embedding of spanning trees in biased Maker-Breaker game , joint with Dan Hefetz and Michael Krivelevich, European Journal of Combinatorics 33 (2012), 1086-1099.
  2. Fast strategies in Maker-Breaker games played on random boards , joint with Dennis Clemens, Michael Krivelevich and Anita Liebenau, Combinatorics, Probability and Computing  21 (2012), 897-915.

2011

  1. Hitting time results for Maker-Breaker games , joint with Sonny Ben-Shimon, Dan Hefetz and Michael Krivelevich, Proceedings of the 22nd Symposium on Discrete Algorithms (SODA'11), 900-912. Random Structures and Algorithms 41 (2012), 23-46.  
  2. Winning strong games through fast strategies for weak games , joint with Dan Hefetz, The Electronic Journal of Combinatorics, 18(1) 2011, P144.

2010

  1. On almost precipitous ideals , joint with Moti Gitik, Archive for Mathematical Logic: Volume 49, Issue 3 (2010), Page 301.

 

Thesis

  1. My Master's thesis.
  2. My PhD thesis.