University of Cambridge > Talks.cam > Combinatorics Seminar > The largest K_s-free induced subgraph in a K_t-free graph

  Browse A-Z

Log in

Googledetails Microsoftdetails

πŸ” Log In

Information on

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

ℹ️ Information

The largest K_s-free induced subgraph in a K_t-free graph

Download to your calendar using vCal

  • UserOliver Janzer (University of Cambridge)
  • ClockThursday 01 November 2018, 14:30-15:30
  • HouseMR12.

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

The ErdΕ‘s-Rogers function measures how large a K_s-free induced subgraph there must be in a K_t-free graph on n vertices. Good estimates are known when t=s+1, but in general there are significant gaps between the best known lower and upper bounds. We have improved the best known upper bound for s+2<=t<=2s-1. In this talk, I shall describe the construction, and sketch the proof that it has the required properties. This is joint work with Tim Gowers

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Sainsbury Laboratory, University of Cambridge Webinar &amp; LT2, Computer Laboratory, William Gates Building. Computer Lab, FW26

Other talks

Sera Markoff Inaugural Lecture for the Plumian Professorship in Astronomy and Experimental Philosophy - 'Staring into the heart of darkness: from theory to the direct imaging of black holes' A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist Using numerical simulations for solving spectral geometry problems Title abstract tbc The Inaccessible Game Together Now: Cooperation and Collaboration in Social Art Practice
 

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