1 Introduction

2 Graphs with the Erdős-Hajnal property

3 Approximate results

4 Tournaments

5 Linear-size cliques, stable sets and transitive subtournaments

6 Near-linear transitive subtournaments