University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Recent work on the Erdos-Hajnal Conjecture

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Recent work on the Erdos-Hajnal Conjecture

Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

OOEW04 - Structure and Randomness - a celebration of the mathematics of Timothy Gowers

A typical graph contains cliques and independent sets of no more than logarithmic size.  The Erdos-Hajnal Conjecture asserts that if we forbid some induced subgraph H then we can do much better: the conjecture claims that there is some c=c(H)>0 such that every H-free graph G contains a clique or independent set of size at least |G|^c.  The conjecture looks far out of reach, and is only known for a small family of graphs.  We will discuss some recent progress. Joint work with Tung Nguyen and Paul Seymour.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 8873.80405405 kWh Michaelhouse, St. Michael’s Church, Trinity Street, Camb CB2 1SU Cripps Court, Magdalene College, Cambridge

Other talks

Early cancer clinical trials Title to be confirmed Studying viruses to understand what makes pandemic viruses special and how innate immunity works TBC The Jiangmen Underground Neutrino Observatory (JUNO): Status and First Physics Results Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity