Browsing Waterloo Research by Subject "forests"
Now showing items 1-1 of 1
-
Pure pairs. I. Trees and linear anticomplete pairs
(Elsevier, 2020-12-02)The Erdős-Hajnal conjecture asserts that for every graph H there is a constant c > 0 such that every graph G that does not contain H as an induced subgraph has a clique or stable set of cardinality at least |G|c. In this ...