Ringi Kim

activity

20132026

most citedUnavoidable induced subgraphs in large graphs with no homogeneous sets

11 citations · 45 across the 20 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 3 cited

Tree-chromatic number is not equal to path-chromatic number

Tony Huynh, Ringi Kim

For a graph $G$ and a tree-decomposition $(T, B)$ of $G$ , the chromatic number of $(T, B)$ is the maximum of $χ (G [B])$ , taken over all bags $B \in B$ .…

math.CO2015★ 11 cited

Unavoidable induced subgraphs in large graphs with no homogeneous sets

Maria Chudnovsky, Ringi Kim, Sang-il Oum +1

A homogeneous set of an $n$ -vertex graph is a set $X$ of vertices ( $2 \leq ∣ X ∣ \leq n - 1$ ) such that every vertex not in $X$ is either complete or anticomplete to $X$ . A graph is called…