Ringi Kim

collaborators

2 papers

math.CO2026

Minimum degree conditions for removable matchings in $k$ -connected graphs

Hojin Chu, Ringi Kim, Boram Park

In 1969, Halin proved that every $k$ -connected graph $G$ with minimum degree at least $k + 1$ contains an edge $e$ such that $G - e$ is $k$ -connected. As an edge is a matching of size…

math.CO2026

Existence of cycles of length divisible by 3 or 4

Ilkyoo Choi, Hojin Chu, Ringi Kim +1

Dean conjectured that for each integer $k \geq 3$ , every graph with minimum degree at least $k$ has a cycle whose length is divisible by $k$ ; this conjecture is known to be true for…

Minimum degree conditions for removable matchings in k-connected graphs

Existence of cycles of length divisible by 3 or 4

Minimum degree conditions for removable matchings in $k$ -connected graphs