Minki Kim

activity

20152019

most citedNotes on complexity of packing coloring

10 citations · 18 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2019

Word-representability of Toeplitz graphs

Gi-Sang Cheon, Jinha Kim, Minki Kim +1

Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $x y x y \dots$ (of even or…

cs.CC2017★ 10 cited

Notes on complexity of packing coloring

Minki Kim, Bernard Lidický, Tomáš Masařík +1

A packing $k$ -coloring for some integer $k$ of a graph $G = (V, E)$ is a mapping $φ : V \to {1, \dots, k}$ such that any two vertices $u, v$ of color $φ (u) = φ (v)$ are in distance at least…

math.CO2016

On tiling the integers with $4$ -sets of the same gap sequence

Ilkyoo Choi, Junehyuk Jung, Minki Kim

Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been consi…

math.CO2015★ 8 cited

A note on the colorful fractional Helly theorem

Minki Kim

Helly's theorem is a classical result concerning the intersection patterns of convex sets in $R^{d}$ . Two important generalizations are the colorful version and the fraction…

Word-representability of Toeplitz graphs

Notes on complexity of packing coloring

On tiling the integers with 4-sets of the same gap sequence

A note on the colorful fractional Helly theorem

On tiling the integers with $4$ -sets of the same gap sequence