Now showing items 1-1 of 1
Forcing Large Transitive Subtournamets
(Georgia Institute of Technology, 2012-05)
The Erdos Hajnal Conjecture states roughly that a graph with some induced subgraph excluded has a large clique or a large stable set. A similar statement can be formulated for tournaments (a tournament is an orientation ...