2025
21. On Sidorenko exponents of hypergraphs, 22 pages.
20. On a Ramsey--Turán variant of Roth's theorem, 16 pages,
with Matija Bucić, Micha Christoph, Jaehoon Kim, and Varun Sivashankar.
19. Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions, 34 pages,
with Nemanja Draganić, Jaehoon Kim, David Munhá Correia, Matías Pavez-Signé, and Benny Sudakov.
18. On the order of intersecting hypergraphs, 13 pages,
with Stijn Cambie, Jaehoon Kim, Hong Liu, and Tuan Tran.
17. Spanning clique subdivisions in pseudorandom graphs, 16 pages,
with Matías Pavez-Signé and Teo Petrov.
16. On high discrepancy $1$-factorizations of complete graphs, 11 pages,
with Jiangdong Ai, Fankang He, and Seonghyuk Im.
15. Reconstructing hypergraph matching polynomials, 11 pages,
with Donggyu Kim.
14. A quantitative improvement on the hypergraph Balog-Szemeredi-Gowers theorem, 13 pages.
2024
13. Transversal cycles and paths in tournaments, 29 pages,
with Debsoumya Chakraborti, Jaehoon Kim, and Jaehyeon Seo.
12. Random matchings in linear hypergraphs, 15 pages.
(Forum of Mathematics, Sigma, accepted)
11. Dirac's theorem for linear hypergraphs,
with Seonghyuk Im.
(Siam Journal on Discrete Mathematics)
10. Dense triangle-free (n, d, \lambda)-graphs for all orders, 9 pages,
with Jaehoon Kim.
2023
9. On rainbow Turan densities of trees,
with Seonghyuk Im, Jaehoon Kim, and Haesong Seo.
(Random Structures and Algorithms)
8. Towards a high-dimensional Dirac's theorem.
(Siam Journal on Discrete Mathematics)
7. Hamilton transversals in tournaments,
with Debsoumya Chakraborti, Jaehoon Kim, and Jaehyeon Seo.
(Combinatorica)
6. Spanning subdivisions in dense digraphs.
(European Journal of Combinatorics)
5. Covering multigraphs with bipartite graphs,
with Jaehoon Kim.
(Journal of Graph Theory, Accepted)
4. On the spectral radius of graphs with given maximum degree and girth,
with Jiangdong Ai, Seonghyuk Im, Jaehoon Kim, Suil O, and Liwen Zhang.
(Linear algebra and its applications)
3. On perfect subdivision tilings.
(Cominatorics, Probability and Computing)
2022
2. On a rainbow extremal problem for color-critical graphs,
with Debsoumya Chakraborti, Jaehoon Kim, Hong Liu, and Jaehyeon Seo.
(Random Structures and Algorithms)
2021
1. On 1-subdivision of transitive tournaments,
with Jaehoon Kim and Jaehyeon Seo.
(Electronic Journal of Combinatorics)
Jiangdong Ai, Matija Bucić, Stijn Cambie, Debsoumya Chakraborti, Micha Christoph, Nemanja Draganić, Fankang He, Seonghyuk Im, Donggyu Kim, Jaehoon Kim, Hong Liu, David Munhá Correia, Suil O, Matías Pavez-Signé, Haesong Seo, Jaehyeon Seo, Benny Sudakov, Tuan Tran, Liwen Zhang.