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

3 papers · 1 filter

math.CO2022

A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

Seonghyuk Im, Jaehoon Kim, Joonkyung Lee +1

Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $μ > 0$ , there exists $n_{0}$ such that the f…

cs.CC2022★ 5 cited

The proper conflict-free $k$ -coloring problem and the odd $k$ -coloring problem are NP-complete on bipartite graphs

Jungho Ahn, Seonghyuk Im, Sang-il Oum

A proper coloring of a graph is \emph{proper conflict-free} if every non-isolated vertex $v$ has a neighbor whose color is unique in the neighborhood of $v$ . A proper coloring of a…

math.CO2022

Crux, space constraints and subdivisions

Seonghyuk Im, Jaehoon Kim, Younjin Kim +1

For a given graph $H$ , its subdivisions carry the same topological structure. The existence of $H$ -subdivisions within a graph $G$ has deep connections with topological, structural…

A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs

Crux, space constraints and subdivisions

The proper conflict-free $k$ -coloring problem and the odd $k$ -coloring problem are NP-complete on bipartite graphs