# CV

My full version of CV is here

# Education

- Integrated master’s/doctoral program, Department of Mathematical Sciences, KAIST, 2021-Current
- B.S. in Department of Mathematical Sciences, KAIST, 2016-2020

# Publications

### Preprints

- On rainbow Turán Densities of Trees

Joint work with Jaehoon Kim, Hyunwoo Lee, and Haesong Seo

*arXiv:2312.15956* - A bandwidth theorem for graph transversals

Joint work with Debsoumya Chakraborti, Jaehoon Kim, and Hong Liu

*arXiv:2302.09637* - A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

Joint work with Jaehoon Kim, Joonkyong Lee, and Abhishek Methuku

*arXiv:2208.10370* - The proper conict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs

Joint work with Jungho Ahn and Sang-il Oum

*arXiv:2208.08330* - Crux, space constraints and subdivisions

Joint work with Jaehoon Kim, Younjin Kim, and Hong Liu

*arXiv:2207.06653*

### Published

#### 2016

- On the mean square displacement of a random walk on a graph.

Joint work with Hwidong Kim, Jiho Maeng, Jihwan Yu, Yongwook Cha, and Seong-HunPaeng

*European Journal of Combinatorics*51 (2016):227-235

# Talks

### 2023

- European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB’23)

August 31, 2023

Crux, space constraints and subdivisions (Extended abstract) - 2023 KMS Spring Meeting - Special Section: Extremal Combinatorics: Methods and Applications

April 29, 2023

A bandwidth theorem for graph transversals (site) - Shandong University

March 30, 2023

A bandwidth theorem for graph transversals (Bilibili)

### 2022

- IBS Discrite Math Seminar

November 29, 2022

A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Youtube) - KAIST Math Graduate student Seminar (KMGS)

Novembeer 3, 2022

Large clique subdivisions in graphs without small dense subgraphs

### 2021

- 2021 Combinatorics Workshop

December 21, 2021

Large clique subdivisions in graphs without small dense subgraphs (Youtube) - IBS Discrite Math Seminar

November 30, 2021

Large clique subdivisions in graphs without small dense subgraphs (Youtube)

# Teaching

### Teachings

### TA works

- (2023 fall) MAS 102 Calculus 1 and MAS 480 Topological methods in combinatorics at KAIST
- (2023 spring) MAS 101 Calculus 1 and MAS 250 Discrete mathematics at KAIST
- (2022 fall) MAS 102 Calculus 2 and MAS 477 Introduction to Graph Theory at KAIST
- (2022 spring) MAS 102 Calculus 2 and MAS 275 Discrete mathematics at KAIST
- (2021 fall) MAS 102 Calculus 2 and CC511 Probability and Statistics at KAIST
- (2021 spring) MAS 101 Calculus 1 at KAIST (Won the Outstanding Teaching Assistant Award)