| Publication | Date of Publication | Type |
|---|
Online Ramsey numbers of ordered paths and cycles
(available as arXiv preprint) | N/A | Paper |
On a Traveling Salesman Problem for Points in the Unit Cube
(available as arXiv preprint) | N/A | Paper |
The number of regular simplices in higher dimensions
Bulletin of the London Mathematical Society | 2026-08-18 | Paper |
Crossing numbers of billiard curves in the multidimensional box via translation manifolds
The Australasian Journal of Combinatorics | 2026-08-04 | Paper |
On multiplicities of interpoint distance
Acta Mathematica Hungarica | 2026-01-20 | Paper |
Applications of sparse hypergraph colorings
Discrete Mathematics | 2025-12-15 | Paper |
Non-degenerate hypergraphs with exponentially many extremal constructions
Journal of Combinatorial Theory. Series B | 2025-09-16 | Paper |
Almost congruent triangles
Discrete & Computational Geometry | 2025-03-19 | Paper |
Online Ramsey numbers of ordered paths and cycles
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
On a traveling salesman problem for points in the unit cube
Algorithmica | 2024-10-07 | Paper |
10 problems for partitions of triangle-free graphs
European Journal of Combinatorics | 2024-09-30 | Paper |
Unavoidable order-size pairs in hypergraphs -- positive forcing density
Combinatorial Theory | 2024-04-02 | Paper |
Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
Journal of Graph Theory | 2024-03-25 | Paper |
Hypergraph Turán Problems in l2-Norm
Surveys in Combinatorics 2022 | 2024-01-05 | Paper |
Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
Journal of the London Mathematical Society | 2023-08-21 | Paper |
Balanced edge-colorings avoiding rainbow cliques of size four
The Electronic Journal of Combinatorics | 2023-08-18 | Paper |
The Spectrum of Triangle-Free Graphs
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
On stability of the Erdős-Rademacher problem
Illinois Journal of Mathematics | 2023-05-31 | Paper |
On stability of the Erdős-Rademacher problem
Illinois Journal of Mathematics | 2023-05-31 | Paper |
Making <i>K</i><sub><i>r</i>+1</sub>-free graphs <i>r</i>-partite
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
| Almost Congruent Triangles | 2023-03-26 | Paper |
Counting \(r\)-graphs without forbidden configurations
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
| Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions | 2022-08-01 | Paper |
Maximum number of almost similar triangles in the plane
Computational Geometry | 2022-06-13 | Paper |
| 10 Problems for Partitions of Triangle-free Graphs | 2022-03-29 | Paper |
A strengthening of the Erdős-Szekeres theorem
European Journal of Combinatorics | 2022-01-13 | Paper |
Flexibility of planar graphs -- sharpening the tools to get lists of size four
Discrete Applied Mathematics | 2021-11-11 | Paper |
| Max Cuts in Triangle-free Graphs | 2021-03-25 | Paper |
Ordered size Ramsey number of paths
Discrete Applied Mathematics | 2020-04-01 | Paper |
The Ramsey number of Fano plane versus tight path
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
The Ramsey number of Fano plane versus tight path
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Making $K_{r+1}$-Free Graphs $r$-partite
(available as arXiv preprint) | 2019-09-30 | Paper |
