Loading Events

« All Events

  • This event has passed.

Michael Savery, Induced subgraphs of induced subgraphs of large chromatic number

April 27 Wednesday @ 4:30 PM - 5:30 PM KST

Zoom ID: 869 4632 6610 (ibsdimag)

We prove that for every graph F with at least one edge there are graphs H of arbitrarily large chromatic number and the same clique number as F such that every F-free induced subgraph of H has chromatic number at most c=c(F). (Here a graph is F-free if it does not contain an induced copy of F.) This generalises recent theorems of Briański, Davies and Walczak, and of Carbonero, Hompe, Moore and Spirkl. We further show an analogous statement where clique number is replaced by odd girth. This is joint work with Antonio Girão, Freddie Illingworth, Emil Powierski, Alex Scott, Youri Tamitegama and Jane Tan.


April 27 Wednesday
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:


Zoom ID: 869 4632 6610 (ibsdimag)


O-joung Kwon (권오정)
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.