| Publication | Date of Publication | Type |
|---|
Hamiltonicity of sparse pseudorandom graphs
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
Friendly bisections of random graphs
Communications of the American Mathematical Society | 2023-10-17 | Paper |
On subgraphs with degrees of prescribed residues in the random graph
Random Structures & Algorithms | 2023-10-12 | Paper |
Counting Hamilton cycles in Dirac hypergraphs
Combinatorica | 2023-10-04 | Paper |
Singularity of the \(k\)-core of a random graph
Duke Mathematical Journal | 2023-05-11 | Paper |
Sparse recovery properties of discrete random matrices
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
Singularity of sparse random matrices: simple proofs
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Mathematical Proceedings of the Cambridge Philosophical Society | 2023-02-10 | Paper |
| Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs | 2022-11-10 | Paper |
Every graph contains a linearly sized induced subgraph with all degrees odd
Advances in Mathematics | 2022-08-04 | Paper |
List-Decodability With Large Radius for Reed-Solomon Codes
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Dirac-type theorems in random hypergraphs
Journal of Combinatorial Theory. Series B | 2022-04-27 | Paper |
| Counting Hamiltonian Cycles in Dirac Hypergraphs | 2021-10-28 | Paper |
Singularity of random symmetric matrices -- simple proof
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2021-09-03 | Paper |
On the counting problem in inverse Littlewood-Offord theory
Journal of the London Mathematical Society | 2021-08-13 | Paper |
Resilience of the rank of random matrices
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
A quantitative Lovász criterion for Property B
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Number of 1-factorizations of regular high-degree graphs
Combinatorica | 2021-01-25 | Paper |
Lower bounds for multicolor Ramsey numbers
Advances in Mathematics | 2021-01-20 | Paper |
Lower bounds for multicolor Ramsey numbers
Advances in Mathematics | 2021-01-20 | Paper |
1‐Factorizations of pseudorandom graphs
Random Structures & Algorithms | 2020-11-30 | Paper |
Almost all Steiner triple systems are almost resolvable
Forum of Mathematics, Sigma | 2020-11-20 | Paper |
Towards the linear arboricity conjecture
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Long monotone trails in random edge-labellings of random graphs
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Supersaturated sparse graphs and hypergraphs
IMRN. International Mathematics Research Notices | 2020-02-17 | Paper |
Co-degrees resilience for perfect matchings in random hypergraphs
The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
Co-degrees resilience for perfect matchings in random hypergraphs
The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
| The probability of selecting $k$ edge-disjoint Hamilton cycles in the complete graph | 2020-01-04 | Paper |
Optimal threshold for a random graph to be 2-universal
Transactions of the American Mathematical Society | 2019-09-26 | Paper |
Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
Forum of Mathematics, Sigma | 2019-09-24 | Paper |
Counting Hamilton decompositions of oriented graphs
IMRN. International Mathematics Research Notices | 2019-09-09 | Paper |
Counting Hamilton decompositions of oriented graphs
IMRN. International Mathematics Research Notices | 2019-09-09 | Paper |
Packing trees of unbounded degrees in random graphs
Journal of the London Mathematical Society | 2019-07-11 | Paper |
Packing and counting arbitrary Hamilton cycles in random digraphs
Random Structures & Algorithms | 2019-06-07 | Paper |
| Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs | 2019-03-28 | Paper |
Spanning universality in random graphs
Random Structures & Algorithms | 2019-02-20 | Paper |
Law of the iterated logarithm for random graphs
Random Structures & Algorithms | 2019-02-20 | Paper |
Counting Hamilton cycles in sparse random directed graphs
Random Structures & Algorithms | 2019-02-20 | Paper |
Packing perfect matchings in random hypergraphs
Random Structures & Algorithms | 2018-05-25 | Paper |
Resilience for the Littlewood-Offord problem
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Packing loose Hamilton cycles
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
Embedding large graphs into a random graph
Bulletin of the London Mathematical Society | 2017-10-24 | Paper |
Robust Hamiltonicity of random directed graphs: extended abstract
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Hitting time results for maker-breaker games (extended abstract) | 2017-09-29 | Paper |
Resilience for the Littlewood-Offord problem
Advances in Mathematics | 2017-09-19 | Paper |
Robust Hamiltonicity of random directed graphs
Journal of Combinatorial Theory. Series B | 2017-08-22 | Paper |
Packing, counting and covering Hamilton cycles in random directed graphs
Israel Journal of Mathematics | 2017-08-10 | Paper |
Efficient winning strategies in random-turn maker-breaker games
Journal of Graph Theory | 2017-07-05 | Paper |
Packing spanning graphs from separable families
Israel Journal of Mathematics | 2017-06-09 | Paper |
Almost-spanning universality in random graphs
Random Structures & Algorithms | 2017-06-02 | Paper |
Almost-spanning universality in random graphs
Random Structures & Algorithms | 2017-06-02 | Paper |
Strong games played on random graphs
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Strong games played on random graphs
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Rainbow Hamilton cycles in random graphs and hypergraphs
Recent Trends in Combinatorics | 2017-01-25 | Paper |
Counting and packing Hamilton cycles in dense graphs and oriented graphs
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
| Almost-spanning universality in random graphs (extended abstract) | 2016-10-14 | Paper |
Packing, counting and covering Hamilton cycles in random directed graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Packing, counting and covering Hamilton cycles in random directed graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Universality of random graphs and rainbow embedding
Random Structures & Algorithms | 2016-06-10 | Paper |
| Random matrices: Law of the iterated logarithm | 2016-05-24 | Paper |
Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
Journal of Combinatorics | 2016-02-19 | Paper |
Generating random graphs in biased maker-breaker games
Random Structures & Algorithms | 2016-01-07 | Paper |
Building spanning trees quickly in maker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Building spanning trees quickly in maker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
On a conjecture of Thomassen
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
On a conjecture of Thomassen
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Biased games on random boards
Random Structures & Algorithms | 2015-07-23 | Paper |
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
A construction of almost Steiner systems
Journal of Combinatorial Designs | 2014-12-22 | Paper |
| Packing a randomly edge-colored random graph with rainbow $k$-outs | 2014-10-07 | Paper |
Weak and strong \(k\)-connectivity games
European Journal of Combinatorics | 2014-07-29 | Paper |
| scientific article; zbMATH DE number 6303013 (Why is no real title available?) | 2014-06-11 | Paper |
Avoider-Enforcer games played on edge disjoint hypergraphs
Discrete Mathematics | 2014-01-27 | Paper |
| Fast embedding of spanning trees in biased maker-breaker games | 2013-11-01 | Paper |
Fast embedding of spanning trees in biased maker-breaker games
(available as arXiv preprint) | 2013-11-01 | Paper |
The biased odd cycle game
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
The biased odd cycle game
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Fast strategies in maker-breaker games played on random boards
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
Hitting time results for maker-breaker games
Random Structures & Algorithms | 2012-08-30 | Paper |
Fast embedding of spanning trees in biased maker-breaker games
European Journal of Combinatorics | 2012-06-18 | Paper |
Winning strong games through fast strategies for weak games
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Winning strong games through fast strategies for weak games
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
On almost precipitous ideals
Archive for Mathematical Logic | 2010-04-15 | Paper |
Hamiltonicity of Sparse Pseudorandom Graphs
(available as arXiv preprint) | N/A | Paper |
A quantum algorithm for learning a graph of bounded degree
(available as arXiv preprint) | N/A | Paper |
