Some Results in NIP Theories

We give a proof using model-theoretic techniques and substitution that the Erdos-Hajnal property holds for graphs with VC-dimension at most 2. We also show that the family of graphs with bounded VC-minimal complexity, a notion that arises from VC-minimal theory, has the strong Erdos-Hajnal property. And we prove a lemma about combs and pure pairs that the author found when attempting to prove the Erdos-Hajnal property for dp-minimal graphs.