Tournaments With Forbidden Substructures and the Erdos-Hajnal Conjecture
A celebrated Conjecture of Erdos and Hajnal states that for every undirected graph H there exists ɛ(H)>0 such that every undirected graph on n vertices that does not contain H as an induced subgraph contains a clique or a stable set of size at least n^{ɛ(H)}. In 2001 Alon, Pach and Solymosi prove...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://doi.org/10.7916/D84J0N9P |