Writing
Submitted Papers
Edge-disjoint cycles with the same vertex set (with O. Janzer, A. Methuku, and R. Montgomery).
Transversal cycles and paths in tournaments (with J. Kim, H. Lee, and J. Seo).
Approximate packing of independent transversals in locally sparse graphs (with T. Tran).
Robust Hamiltonicity in families of Dirac graphs (with M. Anastos).
Twin-width of subdivisions of multigraphs (with J. Ahn, K. Hendrey, and S. Oum).
A bandwidth theorem for graph transversals (with S. Im, J. Kim, and H. Liu).
Large rainbow matchings in edge-colored graphs (with P. Loh).
Published Papers
Hamilton transversals in tournaments (with J. Kim, H. Lee, and J. Seo), accepted by Combinatorica.
Twin-width of random graphs (with J. Ahn, K. Hendrey, D. Kim, and S. Oum), Random Structures & Algorithms, appeared online.
Almost spanning distance trees in subsets of finite vector spaces (with B. Lund), Bulletin of the London Mathematical Society, 56(5) (2024), 1716--1733.
On a rainbow extremal problem for color-critical graphs (with J. Kim, H. Lee, H. Liu, and J. Seo), Random Structures & Algorithms, 64(2) (2024), 460--489.
Exact results on generalized Erdős-Gallai problems (with D. Q. Chen), European Journal of Combinatorics, 120 (2024), 103955.
Rainbow saturation for complete graphs (with K. Hendrey, B. Lund, and C. Tompkins), SIAM Journal on Discrete Mathematics, 38(1) (2024), 1090--1112.
Fractional Helly theorem for Cartesian products of convex sets (with J. Kim, J. Kim, M. Kim, and H. Liu), Discrete & Computational Geometry, 70(4) (2023), 1632--1651.
Majority dynamics on sparse random graphs (with J. H. Kim, J. Lee, and T. Tran), Random Structures & Algorithms, 63(1) (2023), 171--191.
Extremal bipartite independence number and balanced coloring, European Journal of Combinatorics, 113 (2023), 103750.
Colorful Hamilton cycles in random graphs (with A. Frieze and M. Hasabnis), SIAM Journal on Discrete Mathematics, 37(1) (2023), 51--64.
Well-mixing vertices and almost expanders (with J. Kim, J. Kim, M. Kim, and H. Liu), Proceedings of the American Mathematical Society, 150(12) (2022), 5097--5110.
Many cliques with few edges and bounded maximum degree (with D. Q. Chen), Journal of Combinatorial Theory, Series B, 151 (2021), 1--20.
Minimizing the number of edges in K_{s,t}-saturated bipartite graphs (with D. Chen and M. Hasabnis), SIAM Journal on Discrete Mathematics, 35(2) (2021), 1165--1181.
The threshold for the full perfect matching color profile in a random coloring of random graphs (with M. Hasabnis), Electronic Journal of Combinatorics, 28(1) (2021), P1.21.
A note on volume thresholds for random polytopes (with T. Tkocz and B. Vritsiou), Geometriae Dedicata, 213 (2021), 423--431.
Isomorphism for Random k-Uniform Hypergraphs (with A. Frieze, S. Haber, and M. Hasabnis), Information Processing Letters, 166 (2021), 106039.
The game chromatic number of a random hypergraph (with A. Frieze and M. Hasabnis), Discrete Mathematics and Applications, 165 (2020), 153--175.
Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph (with P. Loh), European Journal of Combinatorics, 90 (2020), 103185.
Extremal graphs with local covering conditions (with P. Loh), SIAM Journal on Discrete Mathematics, 34(2) (2020), 1354--1374.
Coauthors
Jungho Ahn, Michael Anastos, Da Qi Chen, Alan Frieze, Simi Haber, Mihir Hasabnis, Kevin Hendrey, Seonghyuk Im, Oliver Janzer, Donggyu Kim, Jaehoon Kim, Jeong Han Kim, Jinha Kim, Minki Kim, Hyunwoo Lee, Joongkyung Lee, Hong Liu, Po-Shen Loh, Ben Lund, Abhishek Methuku, Richard Montgomery, Sang-il Oum, Jaehyeon Seo, Tomasz Tkocz, Casey Tompkins, Tuan Tran, Beatrice-Helen Vritsiou.