| Publication | Date of Publication | Type |
|---|
Percolation on High-dimensional Product Graphs
(available as arXiv preprint) | N/A | Paper |
Percolation on Irregular High-dimensional Product Graphs
(available as arXiv preprint) | N/A | Paper |
Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
(available as arXiv preprint) | N/A | Paper |
Maximum chordal subgraphs of random graphs
(available as arXiv preprint) | N/A | Paper |
Percolation through Isoperimetry
(available as arXiv preprint) | N/A | Paper |
Colouring graphs from random lists
(available as arXiv preprint) | N/A | Paper |
Hitting time of connectedness in the random hypercube process
(available as arXiv preprint) | N/A | Paper |
Reconstructing random graphs from distance queries
(available as arXiv preprint) | N/A | Paper |
| Reconstructing random graphs from distance queries | 2026-08-31 | Paper |
Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
Transactions of the American Mathematical Society | 2026-08-19 | Paper |
On the edge expansion of random polytopes
IMRN. International Mathematics Research Notices | 2026-07-09 | Paper |
| Regular languages are testable with a constant number of queries | 2026-05-06 | Paper |
| Efficient testing of large graphs | 2026-05-06 | Paper |
Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
Minors in small-set expanders
Proceedings of the American Mathematical Society | 2026-03-17 | Paper |
Minimum degree conditions for graph rigidity
Bulletin of the London Mathematical Society | 2026-02-04 | Paper |
Fast construction on a restricted budget
Random Structures & Algorithms | 2026-01-16 | Paper |
Colouring random subgraphs
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
Maximum chordal subgraphs of random graphs
Combinatorics, Probability and Computing | 2025-12-16 | Paper |
Components, large and small, are as they should be. II: Supercritical percolation on regular graphs of constant degree
IMRN. International Mathematics Research Notices | 2025-09-26 | Paper |
Rigid partitions: from high connectivity to random graphs
Journal of Combinatorial Theory. Series B | 2025-09-16 | Paper |
Component games on random graphs
Combinatorica | 2025-06-19 | Paper |
Minors, connectivity, and diameter in randomly perturbed sparse graphs
European Journal of Combinatorics | 2025-06-02 | Paper |
Sparse pancyclic subgraphs of random graphs
SIAM Journal on Discrete Mathematics | 2025-03-18 | Paper |
Coloring graphs from random lists
Random Structures & Algorithms | 2025-02-14 | Paper |
Percolation on high-dimensional product graphs
Random Structures & Algorithms | 2025-02-14 | Paper |
Long cycles in percolated expanders
The Electronic Journal of Combinatorics | 2025-01-29 | Paper |
Climbing up a random subgraph of the hypercube
Electronic Communications in Probability | 2024-12-20 | Paper |
The power of many colours
Forum of Mathematics, Sigma | 2024-12-12 | Paper |
Percolation on irregular high-dimensional product graphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Expansion in supercritical random subgraphs of expanders and its consequences
Random Structures & Algorithms | 2024-10-24 | Paper |
Isoperimetric inequalities and supercritical percolation on high-dimensional graphs
Combinatorica | 2024-09-19 | Paper |
| The largest hole in sparse random graphs | 2024-09-13 | Paper |
Greedy maximal independent sets via local limits
Random Structures & Algorithms | 2024-05-17 | Paper |
Hamilton completion and the path cover number of sparse random graphs
European Journal of Combinatorics | 2024-03-26 | Paper |
On vertex Ramsey graphs with forbidden subgraphs
Discrete Mathematics | 2024-01-17 | Paper |
| scientific article; zbMATH DE number 7788347 (Why is no real title available?) | 2024-01-15 | Paper |
| Colouring random subgraphs | 2023-12-13 | Paper |
| Climbing up a random subgraph of the hypercube | 2023-11-28 | Paper |
| Rigid partitions: from high connectivity to random graphs | 2023-11-24 | Paper |
Supercritical site percolation on the hypercube: small components are small
Combinatorics, Probability and Computing | 2023-11-23 | Paper |
| Component sizes in the supercritical percolation on the binary cube | 2023-11-13 | Paper |
Cycle lengths in randomly perturbed graphs
Random Structures & Algorithms | 2023-11-07 | Paper |
The largest hole in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
The largest hole in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Cycle lengths in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Site percolation on pseudo‐random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Complete minors and average degree: A short proof
Journal of Graph Theory | 2023-10-12 | Paper |
The size‐Ramsey number of short subdivisions
Random Structures & Algorithms | 2023-10-12 | Paper |
Color‐biased Hamilton cycles in random graphs
Random Structures & Algorithms | 2023-10-12 | Paper |
On subgraphs with degrees of prescribed residues in the random graph
Random Structures & Algorithms | 2023-10-12 | Paper |
Oriented discrepancy of Hamilton cycles
Journal of Graph Theory | 2023-10-10 | Paper |
Divisible subdivisions
Journal of Graph Theory | 2023-10-04 | Paper |
| The power of many colours | 2023-08-29 | Paper |
Turán‐type problems for long cycles in random and pseudo‐random graphs
Journal of the London Mathematical Society | 2023-08-23 | Paper |
| Sparse pancyclic subgraphs of random graphs | 2023-08-03 | Paper |
Largest subgraph from a hereditary property in a random graph
Discrete Mathematics | 2023-06-12 | Paper |
| Crowns in pseudo-random graphs and Hamilton cycles in their squares | 2023-05-15 | Paper |
Short proofs for long induced paths
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Large complete minors in random subgraphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7651059 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Minors, connectivity, and diameter in randomly perturbed sparse graphs | 2022-12-14 | Paper |
Expansion in supercritical random subgraphs of the hypercube and its consequences
The Annals of Probability | 2022-12-08 | Paper |
Obituary: Robin Thomas (1962--2020)
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
On the performance of the depth first search algorithm in supercritical random graphs
The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
Every graph contains a linearly sized induced subgraph with all degrees odd
Advances in Mathematics | 2022-08-04 | Paper |
Spanning Trees at the Connectivity Threshold
SIAM Journal on Discrete Mathematics | 2022-07-28 | Paper |
| Fast construction on a restricted budget | 2022-07-14 | Paper |
Rolling backwards can move you forward: on embedding problems in sparse expanders
Transactions of the American Mathematical Society | 2022-06-16 | Paper |
| The choosability version of Brooks' theorem -- a short proof | 2022-05-15 | Paper |
| Expansion in Supercritical Random Subgraphs of Expanders and its Consequences | 2022-05-10 | Paper |
Complete Minors in Graphs Without Sparse Cuts
IMRN. International Mathematics Research Notices | 2022-04-05 | Paper |
Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
SIAM Journal on Discrete Mathematics | 2022-04-01 | Paper |
Discrepancies of spanning trees and Hamilton cycles
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
Cycle lengths in expanding graphs
Combinatorica | 2021-06-29 | Paper |
Edge-statistics on large graphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
The genus of the Erdős-Rényi random graph and the fragile genus property
(available as arXiv preprint) | 2021-06-15 | Paper |
| Expansion, long cycles, and complete minors in supercritical random subgraphs of the hypercube | 2021-06-08 | Paper |
Expanders -- how to find them, and what to find in them
Surveys in Combinatorics 2019 | 2021-02-06 | Paper |
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
Random Structures & Algorithms | 2021-01-05 | Paper |
The Kőnig graph process
Random Structures & Algorithms | 2021-01-05 | Paper |
| Component Games on Random Graphs | 2020-12-16 | Paper |
Asymptotics in percolation on high-girth expanders
Random Structures & Algorithms | 2020-10-26 | Paper |
Ron Graham (1935--2020)
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Finding a Hamilton cycle fast on average using rotations and extensions
Random Structures & Algorithms | 2020-09-16 | Paper |
The genus of the Erdős-Rényi random graph and the fragile genus property
Random Structures & Algorithms | 2020-06-19 | Paper |
Random graph's Hamiltonicity is strongly tied to its minimum degree
The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
Random graph's Hamiltonicity is strongly tied to its minimum degree
The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
Semirandom models as benchmarks for coloring algorithms
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Goldberg's conjecture is true for random multigraphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Goldberg's conjecture is true for random multigraphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Greedy maximal independent sets via local limits
(available as arXiv preprint) | 2019-07-16 | Paper |
Long cycles in locally expanding graphs, with applications
Combinatorica | 2019-05-23 | Paper |
| Expanders are universal for the class of all spanning trees | 2019-05-10 | Paper |
| On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm | 2019-05-06 | Paper |
The random k-matching-free process
Random Structures & Algorithms | 2019-02-20 | Paper |
Complete minors in graphs without sparse cuts
(available as arXiv preprint) | 2018-12-05 | Paper |
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
Random Structures & Algorithms | 2018-09-05 | Paper |
Clique coloring of dense random graphs
Journal of Graph Theory | 2018-08-16 | Paper |
| Waiter-Client Maximum Degree Game | 2018-07-29 | Paper |
Packing Hamilton cycles online
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
