Ringi Kim

activity

20132026

most citedThe Alon-Tarsi number of subgraphs of a planar graph

5 citations · 7 across the 8 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

math.CO2019★ 5 cited

The Alon-Tarsi number of subgraphs of a planar graph

Ringi Kim, Seog-Jin Kim, Xuding Zhu

This paper constructs a planar graph $G_{1}$ such that for any subgraph $H$ of $G_{1}$ with maximum degree $Δ (H) \leq 3$ , $G_{1} - E (H)$ is not $3$ -choosable, and a planar graph $G_{2}$ such…

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

Obstructions for partitioning into forests and outerplanar graphs

Ringi Kim, Sergey Norin, Sang-il Oum

For a class $C$ of graphs, we define $C$ -edge-brittleness of a graph $G$ as the minimum $ℓ$ such that the vertex set of $G$ can be partitioned into sets induci…

The Alon-Tarsi number of subgraphs of a planar graph

Largest 2-regular subgraphs in 3-regular graphs

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

Obstructions for partitioning into forests and outerplanar graphs

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