![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Alexander Scott (Oxford)
Thursday 10 November 2022, 14:30-15:30
Induced subgraphs of induced subgraphs of large chromatic number
- 👤 Speaker: Alexander Scott (Oxford)
- 📅 Date & Time: Thursday 10 November 2022, 14:30 - 15:30
- 📍 Venue: MR12
Abstract
We prove that, for every graph F, there is a constant c=c(F) and a graph G of infinite chromatic number in which every induced subgraph of chromatic number at least c contains an induced subgraph isomorphic to F. Furthermore, if F has clique number k>1 then we can take G to have clique number k as well. This generalises recent theorems of Briański, Davies and Walczak, and of Carbonero, Hompe, Moore and Spirkl. Our results show that, for every F , the class of F-free graphs satisfy a very strong Ramsey-type property, giving a very strong generalisation of a result of Folkman from 1970. We also prove an analogous statement where clique number is replaced by odd girth.
Joint work with António Girão, Freddie Illingworth, Emil Powierski, Michael Savery, Youri Tamitegama and Jane Tan.
Series This talk is part of the Combinatorics Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Combinatorics Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
Note: Ex-directory lists are not shown.