Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs

Robert Brignall, Hojin Choi, Jisu Jeong +1

A homogeneous set of a graph $G$ is a set $X$ of vertices such that $2\le |X|<|V(G)|$ and no vertex in $V(G)-X$ has both a neighbor and a non-neighbor in $X$…