Resumen de One graph to rule them all: forbidden structures and universal graphs
Consider all planar graphs on n vertices. What is the smallest graph that contains them all as inducedsubgraphs?In this talk, we will gently introduce the audience to the notion of so-called universal graphs (graphscontaining all graphs of a given family as induced subgraphs), and focus on the case of graph classesdefined by forbidden structures. We present positive and negative results both in dense graphs and insparse graphs. The audience will also have the answer to the question at the beginning of this abstract,recently established in a breakthrough paper of Dujmovi´c, Esperet, Joret, Gavoille, Micek and Morin
