Erdos-Hajnal-type theorems in hypergraphs
The Erdos-Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not contain an induced copy of a given graph H, then it must contain either a clique or an independent set of size n[superscript δ(H)], where δ(H) > 0 depends only on the graph H. Except for a few special...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier,
2015-10-26T11:59:40Z.
|
| Subjects: | |
| Online Access: | Get fulltext |