Asaf Ferber

CoRR, July, 2025

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring.

[BibT_eX]

[DOI]

Liam Hardiman

Xiaonan Chen

CoRR, February, 2025

Hamiltonicity of sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2025

Minimum Degree Edge-Disjoint Hamilton Cycles in Random Directed Graphs.

[BibT_eX]

[DOI]

Adva Mond

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2023

On subgraphs with degrees of prescribed residues in the random graph.

[BibT_eX]

[DOI]

Liam Hardiman

Random Struct. Algorithms, August, 2023

Counting Hamilton Cycles in Dirac Hypergraphs.

[BibT_eX]

[DOI]

Liam Hardiman

Adva Mond

Comb., August, 2023

Sparse recovery properties of discrete random matrices.

[BibT_eX]

[DOI]

Comb. Probab. Comput., March, 2023

2022

Dirac-type theorems in random hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Singularity of sparse random matrices: simple proofs.

[BibT_eX]

[DOI]

Lisa Sauermann

Comb. Probab. Comput., 2022

On the number of Hadamard matrices via anti-concentration.

[BibT_eX]

[DOI]

Yufei Zhao

Comb. Probab. Comput., 2022

2021

Resilience of the rank of random matrices.

[BibT_eX]

[DOI]

Kyle Luh

Gweneth McKinley

Comb. Probab. Comput., 2021

List-decodability with large radius for Reed-Solomon codes.

[BibT_eX]

[DOI]

Lisa Sauermann

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Towards the linear arboricity conjecture.

[BibT_eX]

[DOI]

Jacob Fox

J. Comb. Theory B, 2020

A quantitative Lovász criterion for Property B.

[BibT_eX]

[DOI]

Asaf Shapira

Comb. Probab. Comput., 2020

Long Monotone Trails in Random Edge-Labellings of Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

Co-degrees Resilience for Perfect Matchings in Random Hypergraphs.

[BibT_eX]

[DOI]

Lior Hirschfeld

Electron. J. Comb., 2020

Number of 1-Factorizations of Regular High-Degree Graphs.

[BibT_eX]

[DOI]

Benny Sudakov

Comb., 2020

2019

Law of the iterated logarithm for random graphs.

[BibT_eX]

[DOI]

Daniel Montealegre

Van Vu

Random Struct. Algorithms, 2019

Packing and counting arbitrary Hamilton cycles in random digraphs.

[BibT_eX]

[DOI]

Eoin Long

Random Struct. Algorithms, 2019

Packing trees of unbounded degrees in random graphs.

[BibT_eX]

[DOI]

Wojciech Samotij

J. Lond. Math. Soc., 2019

2018

Packing perfect matchings in random hypergraphs.

[BibT_eX]

[DOI]

Van Vu

Random Struct. Algorithms, 2018

Spanning universality in random graphs.

[BibT_eX]

[DOI]

Rajko Nenadov

Random Struct. Algorithms, 2018

Counting Hamilton cycles in sparse random directed graphs.

[BibT_eX]

[DOI]

Benny Sudakov

Random Struct. Algorithms, 2018

1-Factorizations of Pseudorandom Graphs.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Finding paths in sparse random graphs requires many queries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Almost-spanning universality in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Efficient Winning Strategies in Random-Turn Maker-Breaker Games.

[BibT_eX]

[DOI]

Gal Kronenberg

J. Graph Theory, 2017

Robust Hamiltonicity of random directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Counting and packing Hamilton cycles in dense graphs and oriented graphs.

[BibT_eX]

[DOI]

Benny Sudakov

J. Comb. Theory B, 2017

Resilience for the Littlewood-Offord Problem.

[BibT_eX]

[DOI]

Afonso S. Bandeira

Electron. Notes Discret. Math., 2017

Packing Loose Hamilton Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

Strong Games Played on Random Graphs.

[BibT_eX]

[DOI]

Pascal Pfister

Electron. J. Comb., 2017

2016

Universality of random graphs and rainbow embedding.

[BibT_eX]

[DOI]

Rajko Nenadov

Ueli Peter

Random Struct. Algorithms, 2016

Finding Hamilton cycles in random graphs with few queries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

2015

Building Spanning Trees Quickly in Maker-Breaker Games.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Generating random graphs in biased Maker-Breaker games.

[BibT_eX]

[DOI]

Humberto Naves

Random Struct. Algorithms, 2015

Biased games on random boards.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Packing, Counting and Covering Hamilton cycles in random directed graphs.

[BibT_eX]

[DOI]

Gal Kronenberg

Eoin Long

Electron. Notes Discret. Math., 2015

Almost-spanning universality in random graphs (Extended abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

On a Conjecture of Thomassen.

[BibT_eX]

[DOI]

Michelle Delcourt

Electron. J. Comb., 2015

Robust hamiltonicity of random directed graphs <i>extended abstract</i>.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Weak and strong <i>k</i>k-connectivity games.

[BibT_eX]

[DOI]

Dan Hefetz

Eur. J. Comb., 2014

2013

Avoider-Enforcer games played on edge disjoint hypergraphs.

[BibT_eX]

[DOI]

Alon Naor

Discret. Math., 2013

The Biased Odd Cycle Game.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Fast Strategies In Maker-Breaker Games Played on Random Boards.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

2011

Fast embedding of spanning trees in biased Maker-Breaker games.

[BibT_eX]

[DOI]

Dan Hefetz

Electron. Notes Discret. Math., 2011

Winning Strong Games through Fast Strategies for Weak Games.

[BibT_eX]

[DOI]

Dan Hefetz

Electron. J. Comb., 2011

Hitting time results for Maker-Breaker games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

On almost precipitous ideals.

[BibT_eX]

[DOI]