| Publication | Date of Publication | Type |
|---|
An unsure note on an un-Schur problem
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
Dirac's theorem for graphs of bounded bandwidth
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
The size-Ramsey number of powers of bounded degree trees
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
More non-bipartite forcing pairs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Almost spanning universality in random graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Resilience for tight Hamiltonicity
Combinatorial Theory | 2024-10-08 | Paper |
The square of a Hamilton cycle in randomly perturbed graphs
Random Structures & Algorithms | 2024-09-02 | Paper |
Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
European Journal of Combinatorics | 2024-03-26 | Paper |
A general approach to transversal versions of Dirac‐type theorems
Bulletin of the London Mathematical Society | 2023-12-18 | Paper |
| On product Schur triples in the integers | 2023-11-30 | Paper |
Triangles in randomly perturbed graphs
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
The anti-Ramsey threshold of complete graphs
Discrete Mathematics | 2023-03-10 | Paper |
| Graphs with large minimum degree and no small odd cycles are $3$-colourable | 2023-02-03 | Paper |
Anti-Ramsey threshold of cycles
Discrete Applied Mathematics | 2022-11-02 | Paper |
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| New Ramsey Multiplicity Bounds and Search Heuristics | 2022-06-08 | Paper |
| Anti-Ramsey threshold of cycles for sparse graphs | 2022-04-27 | Paper |
Maker-Breaker games on randomly perturbed graphs
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
The size-Ramsey number of 3-uniform tight paths
Advances in Combinatorics | 2021-11-05 | Paper |
The size-Ramsey number of powers of bounded degree trees
Journal of the London Mathematical Society | 2021-08-13 | Paper |
Random perturbation of sparse graphs
The Electronic Journal of Combinatorics | 2021-06-07 | Paper |
| Resilience for tight Hamiltonicity | 2021-05-10 | Paper |
| Cycle factors in randomly perturbed graphs | 2021-03-10 | Paper |
Semi-random graph process
Random Structures & Algorithms | 2020-06-19 | Paper |
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika | 2020-06-09 | Paper |
2-universality in randomly perturbed graphs
European Journal of Combinatorics | 2020-05-11 | Paper |
Universality for bounded degree spanning trees in randomly perturbed graphs
Random Structures & Algorithms | 2020-02-14 | Paper |
| More non-bipartite forcing pairs | 2019-06-10 | Paper |
The anti-Ramsey threshold of complete graphs
(available as arXiv preprint) | 2019-02-01 | Paper |
| Embedding spanning bounded degree subgraphs in randomly perturbed graphs | 2018-01-18 | Paper |
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
(available as arXiv preprint) | 2018-01-18 | Paper |
Spanning structures and universality in sparse hypergraphs
Random Structures & Algorithms | 2017-01-05 | Paper |
On universal hypergraphs
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
On universal hypergraphs
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
| On spanning structures in random hypergraphs | 2016-10-14 | Paper |
The square of a Hamilton cycle in randomly perturbed graphs
(available as arXiv preprint) | N/A | Paper |
