| Publication | Date of Publication | Type |
|---|
Lower bounds for Ramsey numbers of bounded degree hypergraphs
Journal of Combinatorial Theory. Series B | 2026-06-16 | Paper |
Ordered Ramsey numbers of graphs with m edges
Proceedings of the American Mathematical Society | 2026-02-03 | Paper |
Unique subgraphs are rare
Proceedings of the American Mathematical Society | 2025-10-14 | Paper |
Weighted Turán theorems with applications to Ramsey-Turán type of problems
Journal of Graph Theory | 2025-08-07 | Paper |
| Effective bounds for induced size-Ramsey numbers of cycles (extended abstract) | 2025-04-08 | Paper |
On a question of Erdős and Nešetřil about minimal cuts in a graph
Journal of Graph Theory | 2025-03-20 | Paper |
Ramsey numbers of hypergraphs with a given size
Mathematical Proceedings of the Cambridge Philosophical Society | 2025-03-12 | Paper |
Effective bounds for induced size-Ramsey numbers of cycles
Combinatorica | 2025-01-14 | Paper |
Lower bounds for Ramsey numbers of bounded degree hypergraphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Large cliques or cocliques in hypergraphs with forbidden order-size pairs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
The extremal number of cycles with all diagonals
IMRN. International Mathematics Research Notices | 2024-10-25 | Paper |
Minimum degree threshold for \(H\)-factors with high discrepancy
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
The growth rate of multicolor Ramsey numbers of 3-graphs
Research in the Mathematical Sciences | 2024-08-15 | Paper |
On Ramsey Size-Linear Graphs and Related Questions
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Counting subgraphs in locally dense graphs
(available as arXiv preprint) | 2024-01-01 | Paper |
On a question of Erdős and Nešetřil about minimal cuts in a graph
(available as arXiv preprint) | 2024-01-01 | Paper |
Clique density vs blowups
(available as arXiv preprint) | 2024-01-01 | Paper |
Unique subgraphs are rare
(available as arXiv preprint) | 2024-01-01 | Paper |
Ordered Ramsey numbers of graphs with m edges
(available as arXiv preprint) | 2024-01-01 | Paper |
| The growth rate of multicolor Ramsey numbers of 3-graphs | 2023-12-21 | Paper |
Covering random graphs with monochromatic trees
Random Structures & Algorithms | 2023-10-19 | Paper |
Asymptotics of the hypergraph bipartite Turán problem
Combinatorica | 2023-10-04 | Paper |
| The extremal number of cycles with all diagonals | 2023-08-30 | Paper |
The Turán number of the grid
Bulletin of the London Mathematical Society | 2023-08-23 | Paper |
| Ramsey numbers of hypergraphs of a given size | 2023-08-21 | Paper |
| Large cliques or co-cliques in hypergraphs with forbidden order-size pairs | 2023-05-02 | Paper |
| Minimum Degree Threshold for H-factors with High Discrepancy | 2023-02-27 | Paper |
| Weighted Tur\'an theorems with applications to Ramsey-Tur\'an type of problems | 2023-02-15 | Paper |
scientific article; zbMATH DE number 7650116 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Robust Algorithms for the Secretary Problem
(available as arXiv preprint) | 2023-02-03 | Paper |
| Effective bounds for induced size-Ramsey numbers of cycles | 2023-01-24 | Paper |
Turán numbers of sunflowers
Proceedings of the American Mathematical Society | 2023-01-10 | Paper |
Powers of Hamilton cycles of high discrepancy are unavoidable
The Electronic Journal of Combinatorics | 2022-08-04 | Paper |
| A generalization of Tur\'{a}n's theorem | 2022-05-18 | Paper |
A generalization of Turán's theorem
(available as arXiv preprint) | 2022-01-01 | Paper |
