5 citations · 5 across the 4 of their papers we have counts for
4 papers
Unavoidable Subtournaments in Tournaments with Large Chromatic Number
Ilhee Kim, Ringi Kim
For a set H of tournaments, we say H is heroic if every tournament, not containing any member of H as a subtournament, has bounded chromatic number. Berger et al. explicitly charac…
The Minimal Automorphism-Free Tree
Ilhee Kim, Ringi Kim, Paul Seymour
A finite tree with is called {\it automorphism-free} if there is no non-trivial automorphism of . Let be the poset with the element set of al…
Tournament Minors
Ilhee Kim, Paul Seymour
We say a digraph is a {\em minor} of a digraph if can be obtained from a subdigraph of by repeatedly contracting a strongly-connected subdigraph to a vertex. Here,…
Forbidden induced subgraphs of double-split graphs
Boris Alexeev, Alexandra Fradkin, Ilhee Kim
In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or…