| Publication | Date of Publication | Type |
|---|
Walker-breaker games on \(G_{n, p}\)
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
Ramsey Equivalence for Asymmetric Pairs of Graphs
SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
Tree universality in positional games
| 2023-12-01 | Paper |
Multistage positional games
Discrete Mathematics | 2023-06-12 | Paper |
On the size-Ramsey number of grid graphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
Walker-Breaker Games on $G_{n,p}$
| 2022-08-19 | Paper |
Minimal Ramsey graphs with many vertices of small degree
SIAM Journal on Discrete Mathematics | 2022-07-13 | Paper |
Maker-Breaker games on randomly perturbed graphs
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
Ramsey simplicity of random graphs
| 2021-09-09 | Paper |
On the minimum degree of minimal Ramsey graphs for cliques versus cycles
| 2021-09-07 | Paper |
Connector-breaker games on random boards
The Electronic Journal of Combinatorics | 2021-07-06 | Paper |
The tree packing conjecture for trees of almost linear maximum degree
| 2021-06-22 | Paper |
On minimal Ramsey graphs and Ramsey equivalence in multiple colours
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
A Dirac-type theorem for Berge cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2020-08-25 | Paper |
The size‐Ramsey number of powers of paths
Journal of Graph Theory | 2019-08-15 | Paper |
How fast can maker win in fair biased games?
Discrete Mathematics | 2017-10-24 | Paper |
Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
The random graph intuition for the tournament game
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
| 2017-02-13 | Paper |
A non-trivial upper bound on the threshold bias of the oriented-cycle game
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
On sets not belonging to algebras and rainbow matchings in graphs
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
| 2016-10-14 | Paper |
Winning fast in fair biased maker-breaker games
| 2016-10-14 | Paper |
Creating cycles in walker-breaker games
Discrete Mathematics | 2016-05-18 | Paper |
An improved bound on the sizes of matchings guaranteeing a rainbow matching
The Electronic Journal of Combinatorics | 2016-05-11 | Paper |
A remark on the tournament game
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Building spanning trees quickly in maker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
scientific article; zbMATH DE number 6303013 (Why is no real title available?)
| 2014-06-11 | Paper |
On the threshold bias in the oriented cycle game
| 2014-06-11 | Paper |
Fast strategies in maker-breaker games played on random boards
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
Creating spanning trees in Waiter-Client games
| N/A | Paper |
