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 2019Show all

8 papers · 1 filter

math.CO2019★ 2 cited

Planar graphs with girth at least 5 are (3,4)-colorable

Ilkyoo Choi, Gexin Yu, Xia Zhang

A graph is $(d_{1}, \dots, d_{k})$ -colorable if its vertex set can be partitioned into $k$ nonempty subsets so that the subgraph induced by the $i$ th part has maximum degree at most $…

math.CO2019

On induced saturation for paths

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

For a graph $H$ , a graph $G$ is $H$ -induced-saturated if $G$ does not contain an induced copy of $H$ , but either removing an edge from $G$ or adding a non-edge to $G$ creates an in…

cs.DM2019

Partitioning sparse graphs into an independent set and a graph with bounded size components

Ilkyoo Choi, François Dross, Pascal Ochem

We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these…

math.CO2019

Collapsibility of non-cover complexes of graphs

Ilkyoo Choi, Jinha Kim, Boram Park

Given a graph $G$ , the non-cover complex of $G$ is the combinatorial Alexander dual of the independence complex of $G$ . Aharoni asked if the non-cover complex of a graph $G$ withou…

math.CO2019

Largest 2-regular subgraphs in 3-regular graphs

Ilkyoo Choi, Ringi Kim, Alexandr Kostochka +2

For a graph $G$ , let $f_{2} (G)$ denote the largest number of vertices in a $2$ -regular subgraph of $G$ . We determine the minimum of $f_{2} (G)$ over $3$ -regular $n$ -vertex simple graphs…

math.CO2019

Maximum $k$ -sum $n$ -free sets of the 2-dimensional integer lattice

Ilkyoo Choi, Ringi Kim, Boram Park

For a positive integer $n$ , let $[n]$ denote ${1, \dots, n}$ . For a 2-dimensional integer lattice point $b$ and positive integers $k \geq 2$ and $n$ , a \textit{ $k$ -sum $…

math.CO2019

On Star 5-Colorings of Sparse Graphs

Ilkyoo Choi, Boram Park

A \textit{star $k$ -coloring} of a graph $G$ is a proper (vertex) $k$ -coloring of $G$ such that the vertices on a path of length three receive at least three colors. Given a graph $…

math.CO2019

Online Ramsey theory for a triangle on $F$ -free graphs

Hojin Choi, Ilkyoo Choi, Jisu Jeong +1

Given a class $C$ of graphs and a fixed graph $H$ , the online Ramsey game for $H$ on $C$ is a game between two players Builder and Painter as follows: an unbound…

Planar graphs with girth at least 5 are (3,4)-colorable

On induced saturation for paths

Partitioning sparse graphs into an independent set and a graph with bounded size components

Collapsibility of non-cover complexes of graphs

Largest 2-regular subgraphs in 3-regular graphs

Maximum k-sum n-free sets of the 2-dimensional integer lattice

On Star 5-Colorings of Sparse Graphs

Online Ramsey theory for a triangle on F-free graphs

Maximum $k$ -sum $n$ -free sets of the 2-dimensional integer lattice

Online Ramsey theory for a triangle on $F$ -free graphs