| Publication | Date of Publication | Type |
|---|
Edge-disjoint paths in expanders: online with removals
SIAM Journal on Computing | 2026-03-31 | Paper |
Minors in small-set expanders
Proceedings of the American Mathematical Society | 2026-03-17 | Paper |
Universality for graphs with bounded density
Journal of Combinatorial Theory. Series B | 2026-03-16 | Paper |
| Global rigidity of random graphs in \({\mathbb{R}}\) | 2026-02-10 | Paper |
The Hamilton space of pseudorandom graphs
Journal of Combinatorial Theory. Series B | 2026-02-09 | Paper |
The largest subgraph without a forbidden induced subgraph
Combinatorica | 2026-01-20 | Paper |
Short proof of the hypergraph container theorem
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
A short note on the characterization of countable chains with finite big Ramsey spectra
Order | 2025-01-15 | Paper |
| Edge-disjoint paths in expanders: online with removals | 2024-11-28 | Paper |
On the size-Ramsey number of grids
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Probabilistic hypergraph containers
Israel Journal of Mathematics | 2024-08-28 | Paper |
| scientific article; zbMATH DE number 7788347 (Why is no real title available?) | 2024-01-15 | Paper |
| Edge-disjoint paths in expanders: online with removals | 2023-10-19 | Paper |
The size‐Ramsey number of short subdivisions
Random Structures & Algorithms | 2023-10-12 | Paper |
Routing permutations on spectral expanders via matchings
Combinatorica | 2023-10-04 | Paper |
The size‐Ramsey number of cubic graphs
Bulletin of the London Mathematical Society | 2023-09-20 | Paper |
| A short note on the characterization of countable chains with finite big Ramsey spectra | 2023-05-04 | Paper |
Probabilistic intuition holds for a class of small subgraph games
Proceedings of the American Mathematical Society | 2023-02-21 | Paper |
A new proof of the KŁR conjecture
Advances in Mathematics | 2022-08-04 | Paper |
Rolling backwards can move you forward: on embedding problems in sparse expanders
Transactions of the American Mathematical Society | 2022-06-16 | Paper |
Complete Minors in Graphs Without Sparse Cuts
IMRN. International Mathematics Research Notices | 2022-04-05 | Paper |
| On the size-Ramsey number of grids | 2022-02-03 | Paper |
The threshold bias of the clique-factor game
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
| Probabilistic hypergraph containers | 2021-11-11 | Paper |
Proof of the Brown-Erdős-Sós conjecture in groups
Mathematical Proceedings of the Cambridge Philosophical Society | 2021-09-14 | Paper |
| Small subsets without $k$-term arithmetic progressions | 2021-09-07 | Paper |
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Sprinkling a few random edges doubles the power
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
| An O(n) time algorithm for finding Hamilton cycles with high probability | 2020-12-04 | Paper |
Completion and deficiency problems
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Bounded degree spanners of the hypercube
The Electronic Journal of Combinatorics | 2020-07-29 | Paper |
On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem
SIAM Journal on Discrete Mathematics | 2020-04-07 | Paper |
On Komlós' tiling theorem in random graphs
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Resilience of perfect matchings and Hamiltonicity in random graph processes
Random Structures & Algorithms | 2019-08-14 | Paper |
Triangle‐factors in pseudorandom graphs
Bulletin of the London Mathematical Society | 2019-07-12 | Paper |
Spanning universality in random graphs
Random Structures & Algorithms | 2019-02-20 | Paper |
Monochromatic cycle covers in random graphs
Random Structures & Algorithms | 2019-02-20 | Paper |
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
Random Structures & Algorithms | 2019-02-20 | Paper |
Optimal induced universal graphs for bounded-degree graphs
Mathematical Proceedings of the Cambridge Philosophical Society | 2019-01-31 | Paper |
Complete minors in graphs without sparse cuts
(available as arXiv preprint) | 2018-12-05 | Paper |
An algorithmic framework for obtaining lower bounds for random Ramsey problems
Journal of Combinatorial Theory. Series B | 2018-10-29 | Paper |
Star-factors in graphs with large minimum degree
Journal of Combinatorial Theory. Series B | 2018-10-11 | Paper |
Optimal induced universal graphs for bounded-degree graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Symmetric and asymmetric Ramsey properties in random hypergraphs
Forum of Mathematics, Sigma | 2017-12-06 | 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 |
An algorithmic framework for obtaining lower bounds for random Ramsey problems: extended abstract
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A short proof of the random Ramsey theorem
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Unique reconstruction threshold for random jigsaw puzzles
Chicago Journal of Theoretical Computer Science | 2017-09-26 | Paper |
Robust Hamiltonicity of random directed graphs
Journal of Combinatorial Theory. Series B | 2017-08-22 | 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 |
| Star-factors in graphs of high degree | 2016-11-15 | Paper |
On the threshold for the maker-breaker \(H\)-game
Random Structures & Algorithms | 2016-11-09 | Paper |
| Almost-spanning universality in random graphs (extended abstract) | 2016-10-14 | Paper |
Universality of random graphs and rainbow embedding
Random Structures & Algorithms | 2016-06-10 | Paper |
On the number of graphs without large cliques
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Finite irreflexive homomorphism-homogeneous binary relational systems
(available as arXiv preprint) | 2012-12-07 | Paper |
On finite reflexive homomorphism-homogeneous binary relational systems
Discrete Mathematics | 2012-04-13 | Paper |
Universality for graphs with bounded density
(available as arXiv preprint) | N/A | Paper |
Global rigidity of random graphs in $\mathbb{R}$
(available as arXiv preprint) | N/A | Paper |
The Hamilton space of pseudorandom graphs
(available as arXiv preprint) | N/A | Paper |
The largest subgraph without a forbidden induced subgraph
(available as arXiv preprint) | N/A | Paper |
