University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Induced trees and Erdos-Hajnal

## Induced trees and Erdos-HajnalAdd to your list(s) Download to your calendar using vCal - Alex Scott, University of Oxford
- Thursday 25 October 2018, 15:00-16:00
- Watson LTB.
If you have a question about this talk, please contact Johannes Carmesin. A hereditary class of graphs has the Erdos-Hajnal property if there is some c>0 such that every graph G in the class contains a complete graph or independent set of size at least |G|^c. The Erdos-Hajnal Conjecture asserts that for every graph H the class of graphs with no induced copy of H has the Erdos-Hajnal property. Resolving a conjecture of Liebenau, Pilipczuk, Seymour and Spirkl, we show that, for every forest T, the class of graphs with no induced copy of T or its complement has the Erdos-Hajnal property. This is joint work with Chudnovsky, Seymour and Spirkl. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsTheoretical Physics Journal Club and Group Meeting 'Roles' Postgraduate Gender and Sexuality Network Discussion Computer Science Distinguished Seminar## Other talksRSC Corday-Morgan Prize Lecture School Seminar I2S Seminar Sphere-packing, lattices and groups The State of Speech in HCI: Trends, Themes and Challenges. Under the spell of gauge theory |