Seonghyuk Im

activity

20182026

k

-coloring problem and the odd

k

-coloring problem are NP-complete on bipartite graphs

5 citations · 6 across the 20 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023★ 1 cited

On rainbow Turán Densities of Trees

Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee +1

For a given collection $G = (G_{1}, \dots, G_{k})$ of graphs on a common vertex set $V$ , which we call a \emph{graph system}, a graph $H$ on a vertex set $V (H) \subseteq V$ is…

math.CO2023

A bandwidth theorem for graph transversals

Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim +1

Given a collection $G = (G_{1}, \dots, G_{h})$ of graphs on the same vertex set $V$ of size $n$ , an $h$ -edge graph $H$ on the vertex set $V$ is a $G$ -transversal if th…