Title: Several Gyrafas-Sumner-type results for treewidth
|Affiliation:||University of Waterloo|
Abstract: For a graph parameter which goes unbounded at both ends of a robust sparsity spectrum, one naturally asks if it is bounded anywhere in the middle. This is modelled after a well-known conjecture of Gyarfas and Sumner, asking the above question for the chromatic number as the parameter and the girth as the measure of sparsity. We look through this lens at the treewidth as the parameter and present a number of recent results answering the corresponding question in various settings. If time permits, we’ll try to sketch a proof as well as some directions for future work.
This is joint work with Bogdan Alecu, Maria Chudnovsky, Sophie Spirkl and partly with Tara Abrishami.