Hojin Chu

collaborators

4 papers

math.CO2025

Connectivity keeping trees in triangle-free graphs

Hojin Chu, Shinya Fujita, Boram Park +1

In 2012, Mader conjectured that for any tree $T$ of order $m$ , every $k$ -connected graph $G$ with minimum degree at least $⌊ \frac{3 k}{2} ⌋ + m - 1$ contains a subtree $T'\c…

math.CO2025

On $2$ -connected graphs avoiding cycles of length $0$ modulo $4$

Hojin Chu, Boram Park, Homoon Ryu

For two integers $k$ and $ℓ$ , an $(ℓ mod k)$ -cycle means a cycle of length $m$ such that $m \equiv ℓ (mod k)$ . In 1977, Bollobás proved a conjecture of Burr and Erd…

math.CO2025

Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition

Hojin Chu, Homoon Ryu

We introduce a linear-time algorithm for computing the Frobenius normal form (FNF) of symmetric Toeplitz matrices by utilizing their inherent structural properties through a graph-…

math.CO2024

Structural properties of a symmetric Toeplitz and Hankel matrices

Hojin Chu, Homoon Ryu

In this paper, we investigate properties of a symmetric Toeplitz matrix and a Hankel matrix by studying the components of its graph. To this end, we introduce the notion of ``weigh…

Connectivity keeping trees in triangle-free graphs

On 2-connected graphs avoiding cycles of length 0 modulo 4

Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition

Structural properties of a symmetric Toeplitz and Hankel matrices

On $2$ -connected graphs avoiding cycles of length $0$ modulo $4$