| Publication | Date of Publication | Type |
|---|
A canonical Ramsey theorem with list constraints in random (hyper-)graphs
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
Resilience for loose Hamilton cycles
Procedia Computer Science | 2025-12-11 | Paper |
A canonical Ramsey theorem with list constraints in random graphs
Procedia Computer Science | 2025-12-11 | Paper |
Counting orientations of graphs with no strongly connected tournaments
Procedia Computer Science | 2025-12-02 | Paper |
Constrained colourings of random graphs
Procedia Computer Science | 2025-12-02 | Paper |
Counting graph orientations with no directed triangles
The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
Separating path systems in complete graphs
Random Structures & Algorithms | 2025-06-17 | Paper |
Directed graphs with lower orientation Ramsey thresholds
RAIRO. Operations Research | 2025-01-08 | Paper |
The size-Ramsey number of powers of bounded degree trees
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Covering 3-coloured random graphs with monochromatic trees
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On the anti-Ramsey threshold for non-balanced graphs
The Electronic Journal of Combinatorics | 2024-04-18 | Paper |
Counting orientations of random graphs with no directed <i>k</i>‐cycles
Random Structures & Algorithms | 2024-03-25 | Paper |
| Separating path systems in complete graphs | 2023-12-22 | Paper |
Factors in randomly perturbed hypergraphs
Random Structures & Algorithms | 2023-10-12 | Paper |
| Resilience for Loose Hamilton Cycles | 2023-09-25 | Paper |
| A canonical Ramsey theorem with list constraints in random graphs | 2023-04-04 | Paper |
| scientific article; zbMATH DE number 7667389 (Why is no real title available?) | 2023-03-23 | Paper |
The anti-Ramsey threshold of complete graphs
Discrete Mathematics | 2023-03-10 | Paper |
| Directed graphs with lower orientation Ramsey thresholds | 2022-11-13 | Paper |
Anti-Ramsey threshold of cycles
Discrete Applied Mathematics | 2022-11-02 | Paper |
Counting orientations of graphs with no strongly connected tournaments
Discrete Mathematics | 2022-09-26 | Paper |
| The threshold for the constrained Ramsey property | 2022-07-11 | Paper |
| Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges | 2022-04-27 | Paper |
| On edge-magic labelings of forests | 2022-04-27 | Paper |
| Anti-Ramsey threshold of cycles for sparse graphs | 2022-04-27 | Paper |
Decomposing split graphs into locally irregular graphs
Electronic Notes in Theoretical Computer Science | 2022-04-27 | 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 |
Covering 3-edge-colored random graphs with monochromatic trees
SIAM Journal on Discrete Mathematics | 2021-06-28 | Paper |
On the local density problem for graphs of given odd-girth
Journal of Graph Theory | 2021-06-25 | Paper |
Decomposing split graphs into locally irregular graphs
Discrete Applied Mathematics | 2021-02-01 | Paper |
Counting restricted orientations of random graphs
Random Structures & Algorithms | 2020-10-26 | Paper |
The multicolour size-Ramsey number of powers of paths
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
| Counting graph orientations with no directed triangles | 2020-05-26 | Paper |
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Random Structures & Algorithms | 2020-02-14 | Paper |
The size‐Ramsey number of powers of paths
Journal of Graph Theory | 2019-08-15 | Paper |
Counting Gallai 3-colorings of complete graphs
Discrete Mathematics | 2019-07-18 | Paper |
Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
Contributions to Discrete Mathematics | 2019-03-05 | Paper |
The anti-Ramsey threshold of complete graphs
(available as arXiv preprint) | 2019-02-01 | Paper |
Monochromatic trees in random graphs
Mathematical Proceedings of the Cambridge Philosophical Society | 2019-01-31 | Paper |
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
SIAM Journal on Discrete Mathematics | 2019-01-23 | Paper |
Decomposing highly connected graphs into paths of length five
Discrete Applied Mathematics | 2018-05-24 | Paper |
On the local density problem for graphs of given odd-girth
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
On an anti-Ramsey threshold for sparse graphs with one triangle
Journal of Graph Theory | 2018-02-23 | Paper |
| On the number of \(r\)-transitive orientations of \(G(n,p)\) | 2018-01-18 | Paper |
Monochromatic trees in random graphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Loose Hamiltonian cycles forced by large (k-2)-degree -- sharp version
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Loose Hamiltonian cycles forced by large (k-2)-degree-approximate version
SIAM Journal on Discrete Mathematics | 2017-10-24 | Paper |
Decomposing regular graphs with prescribed girth into paths of given length
European Journal of Combinatorics | 2017-09-11 | Paper |
Counting results for sparse pseudorandom hypergraphs. I.
European Journal of Combinatorics | 2017-08-31 | Paper |
Counting results for sparse pseudorandom hypergraphs. II.
European Journal of Combinatorics | 2017-08-31 | Paper |
| Edge-magic labelings for constellations and armies of caterpillars | 2017-08-15 | Paper |
| Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version | 2017-02-13 | Paper |
Decomposing highly edge-connected graphs into paths of any given length
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Decompositions of highly connected graphs into paths of length five
(available as arXiv preprint) | 2016-10-17 | Paper |
| A counting lemma for sparse pseudorandom hypergraphs | 2016-10-17 | Paper |
| Path decompositions of regular graphs with prescribed girth | 2016-10-14 | Paper |
| Decompositions of highly connected graphs into paths of any given length | 2016-10-14 | Paper |
Decompositions of triangle-free 5-regular graphs into paths of length five
Discrete Mathematics | 2015-06-29 | Paper |
Ramsey numbers for bipartite graphs with small bandwidth
European Journal of Combinatorics | 2015-06-02 | Paper |
On the number of orientations of random graphs with no directed cycles of a given length
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
On an anti-Ramsey threshold for random graphs
European Journal of Combinatorics | 2014-08-28 | Paper |
| scientific article; zbMATH DE number 6302982 (Why is no real title available?) | 2014-06-11 | Paper |
A note on counting orientations
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On an anti-Ramsey property of random graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
