| Publication | Date of Publication | Type |
|---|
The asymptotic of off-diagonal online Ramsey numbers for paths
(available as arXiv preprint) | N/A | Paper |
Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
(available as arXiv preprint) | N/A | Paper |
Double-jump phase transition for the reverse Littlewood-Offord problem
Journal of the London Mathematical Society. Second Series | 2026-05-27 | Paper |
Reconstructing almost all of a point set in \(\mathbb{R}^d\) from randomly revealed pairwise distances
SIAM Journal on Discrete Mathematics | 2026-04-01 | Paper |
Reconstructing a giant component of a point set in $\mathbb{R}$
(available as arXiv preprint) | 2026-01-01 | Paper |
Cliques in minimally globally rigid graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Approximate Itai-Zehavi conjecture for random graphs
Random Structures & Algorithms | 2026-01-01 | Paper |
Monotonicity and decompositions of random regular graphs
The Annals of Applied Probability | 2026-01-01 | Paper |
Sprinkling for random regular graphs and Kim-Vu's sandwich conjecture
(available as arXiv preprint) | 2026-01-01 | Paper |
On sparse universally rigid graphs in $\mathbb{R}$
(available as arXiv preprint) | 2026-01-01 | Paper |
Exponential odd-distance sets under the Manhattan metric
The Electronic Journal of Combinatorics | 2025-11-12 | Paper |
Tight anti-concentration of Rademacher sums
Random Structures & Algorithms | 2025-08-29 | Paper |
Packing paths in sparse random graphs
Random Structures & Algorithms | 2025-08-29 | Paper |
The complexity of decomposing a graph into a matching and a bounded linear forest
Journal of Graph Theory | 2025-05-04 | Paper |
A proof of the 3/4-conjecture for the total domination game
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
Double-jump phase transition for the reverse Littlewood--Offord problem
(available as arXiv preprint) | 2025-01-01 | Paper |
Monotonicity and decompositions of random regular graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Approximate Itai-Zehavi conjecture for random graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Nearly tight bounds for MaxCut in hypergraphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Tight bounds for expected propagation time of probabilistic zero forcing
(available as arXiv preprint) | 2025-01-01 | Paper |
The asymptotic of off-diagonal online Ramsey numbers for paths
European Journal of Combinatorics | 2024-09-30 | Paper |
A note on interval colourings of graphs
European Journal of Combinatorics | 2024-07-08 | Paper |
On the number of minimum dominating sets and total dominating sets in forests
Journal of Graph Theory | 2024-07-02 | Paper |
Bounds for the competition-independence game on trees
Discrete Mathematics | 2024-01-17 | Paper |
Packing and finding paths in sparse random graphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Almost colour-balanced spanning forests in complete graphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Discrepancies of spanning trees in dense graphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Exponential odd-distance sets under the Manhattan metric
(available as arXiv preprint) | 2024-01-01 | Paper |
A note on high-dimensional discrepancy of subtrees
(available as arXiv preprint) | 2024-01-01 | Paper |
| Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem | 2023-06-13 | Paper |
| The complexity of decomposing a graph into a matching and a bounded linear forest | 2023-04-06 | Paper |
The odd chromatic number of a planar graph is at most 8
Graphs and Combinatorics | 2023-03-09 | Paper |
| On interval colourings of graphs | 2023-03-09 | Paper |
| A note on interval colourings of graphs | 2023-03-08 | Paper |
| Progress towards the 1/2-Conjecture for the domination game | 2023-01-12 | Paper |
On interval colourings of graphs
(available as arXiv preprint) | 2023-01-01 | Paper |
Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem
(available as arXiv preprint) | 2023-01-01 | Paper |
| A proof of the 3/4 conjecture for the total domination game | 2022-11-29 | Paper |
A note on cops and robbers, independence number, domination number and diameter
Discrete Mathematics | 2022-11-02 | Paper |
A new lower bound on the optimal pebbling number of the grid
Discrete Mathematics | 2022-11-02 | Paper |
A faster algorithm for cops and robbers
Discrete Applied Mathematics | 2022-08-24 | Paper |
Ternary Egyptian fractions with prime denominator
Research in Number Theory | 2022-07-13 | Paper |
| On the number of minimum dominating sets and total dominating sets in forests | 2022-06-27 | Paper |
The odd chromatic number of a planar graph is at most 8
(available as arXiv preprint) | 2022-01-28 | Paper |
