A splitter theorem for induced subgraphs
A splitter theorem for induced subgraphs
-
Maria Chudnovsky, Columbia University
A homogeneous set in a graph G is a subset X of V(G), such that no vertex of V(G)/X has both a neighbor and a non-neighbor in X. Let us say that a graph is prime if it has no homogeneous set X with $1