01
Cycle Restrictions & Extremal Problems
Studying how restrictions on cycle lengths constrain graph structure, with particular attention to Turán-type problems and Dean’s conjecture.
- Cycles
- Turán-type problems
- Dean’s conjecture
Research Fellow · KIAS
Hojin Chu
Hello, thank you for visiting my website !
I'm Hojin Chu (추호진), a research fellow in the School of Computational Sciences at the Korea Institute for Advanced Study (KIAS). (Mentor : Prof. Jeong Han Kim)
My research interests are Combinatorics, Graph Theory, and Combinatorial Matrix Theory, with a particular interest in Extremal and Structural Graph Theory. My research has been focused on advancing the theoretical foundations of graph theory and exploring graph structures and their properties.
I enjoy connecting with people 😁 Feel free to e-mail me if you'd like to discuss research topics.
Research
Structure through connection.
I work on structural questions in graph theory and discrete mathematics, often looking for the precise conditions that force a graph to contain—or avoid—a particular configuration.
02
Connectivity-Preserving Deletion
Determining when an edge, matching, path, or tree can be deleted while preserving connectivity in a graph or digraph.
- Subgraph deletion
- Connectivity
- Removable structures
03
Combinatorial Matrix Theory
Using graph-theoretic decompositions to study symmetric Toeplitz and Hankel matrices and develop discrete algorithms.
- Toeplitz & Hankel
- Decomposition
- Algorithms
Publications, preprints, collaborators, and open-problem resources.
View all research ↗