Below you can find my publications with links to their arXiv versions.

Submitted

• Unique subgraphs are rare
  - with Micha Christoph
• Clique density vs blowups
  - with Hong Liu, Zhuo Wu and Zixiang Xu
• Counting subgraphs in locally dense graphs
  - with Benny Sudakov and Yuval Wigderson
• Ramsey numbers of hypergraphs of a given size
  - with Jacob Fox and Benny Sudakov
• Weighted Turán theorems with applications to Ramsey-Turán type of problems
  - with József Balogh and Bernard Lidický

Published

• On a question of Erdős and Nešetřil about minimal cuts in a graph
  - Journal of Graph Theory
• The growth rate of multicolor Ramsey numbers of 3-graphs
  - with Jacob Fox and Benny Sudakov
  - Research in the Mathematical Sciences
• Minimum Degree Threshold for H-factors with High Discrepancy
  - with Micha Christoph and Lior Gishboliner
  - Electronic Journal of Combinatorics
• Effective bounds for induced size-Ramsey numbers of cycles
  - with Nemanja Draganić and Benny Sudakov
  - Combinatorica
• The extremal number of cycles with all diagonals
  - with Abhishek Methuku and Benny Sudakov
  - International Mathematics Research Notices (IMRN)
• Large cliques or co-cliques in hypergraphs with forbidden order-size pairs
  - with Maria Axenovich, Lior Gishboliner, Dhruv Mubayi and Lea Weber
  - Combinatorics, Probability and Computing
• On Ramsey size-linear graphs and related questions
  - with Lior Gishboliner and Benny Sudakov
  - SIDMA
• Asymptotics of the hypergraph bipartite Turán problem
  - with Lior Gishboliner, Oliver Janzer and Benny Sudakov
  - Combinatorica
• The Turán number of the grid
  - with Oliver Janzer, Benny Sudakov and István Tomon
  - Bulletin of the London Mathematical Society
• Turán numbers of sunflowers
  - with Matija Bucić and Benny Sudakov
  - Proceedings of the American Mathematical Society
• Covering random graphs with monochromatic trees
  - with Matija Bucić
  - Random Structures and Algorithms
• Powers of Hamilton cycles of high discrepancy are unavoidable
  - The Electronic Journal of Combinatorics
• Robust Algorithms for the Secretary Problem
  - with Anupam Gupta, Sahil Singla and Goran Žužić
  - 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
• (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing
  - with Sahil Singla and Goran Žužić
  - International Conference on Randomization and Computation (RANDOM 2019)