Michael Savery, Induced subgraphs of induced subgraphs of large chromatic number
We prove that for every graph F with at least one edge there are graphs H of arbitrarily large chromatic number and the same clique number as F such that …
1 event found.