Erdős–Hajnal for graphs with no 5-hole
<p>The Erdős–Hajnal conjecture says that for every graph 𝐻 there exists 𝜏>0 such that every graph𝐺not con-taining𝐻as an induced subgraph has a clique or stable set of cardinality at least |𝐺|𝜏. We prove that this is true when 𝐻 is a cycle of length five. We also prove several...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
London Mathematical Society
2023
|