Marcin Briański, Burling Graphs as (almost) universal obstacles to $\chi$-boundedness
Room B332 IBS (기초과학연구원)What causes a graph to have high chromatic number? One obvious reason is containing a large clique (a set of pairwise adjacent vertices). This naturally leads to investigation of \(\chi\)-bounded classes of graphs --- classes where a large clique is essentially the only reason for large chromatic number. Unfortunately, many interesting graph classes are not …