Marcin Briański, Burling Graphs as (almost) universal obstacles to
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