Ilkyoo Choi

activity

20132026

most citedStrong edge-colorings of sparse graphs with large maximum degree

17 citations · 116 across the 43 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Induced-saturated graphs exist for even cycles

Ilkyoo Choi

A graph $G$ is \emph{ $H$ -induced-saturated} if $G$ has no induced subgraph isomorphic to $H$ but changing the adjacency of an arbitrary pair of vertices in $G$ creates an induced c…

cs.LO2026

Lean-GAP: A Dataset of Formalized Graduate Algebra Problems

Seewoo Lee, Byung-Hak Hwang, Hyojae Lim +10

We present Lean-GAP (Lean-Graduate Agebra Problems), 430 formalized graduate-level algebra problems from the textbook Abstract Algebra by Dummit and Foote. We develop a scalable pi…

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…