Chi-boundedness and eta-boundedness: Dr. Sophie Spirkl

Dr. Sophie Spirkl (University of Waterloo) To colour a graph G means to assign a colour to each vertex such that adjacent vertices receive different colours. The minimum number of distinct colours required to do this is denoted by chi(G). In general, it's hard to say much about chi(G), but it's always at least omega(G), the size of a largest set of pairwise adjacent vertices. I will tell you about some of the results and conjectures in this area, and about another graph parameter, eta(G), which behaves in surprisingly similar ways. Coordinated by the Western Academy for Advanced Research and the Department of Mathematics.