Vendredi 9 septembre à 14h - Jane Tan
Exploring comparable box dimension

Two boxes in R^d are comparable if one of them is a subset of a translation of the other. The comparable box dimension of a graph G is the minimum d such that G can be represented as a touching graph of comparable axis-aligned boxes in R^d. Having finite comparable box dimension implies a number of nice graph properties, which leads us to consider which graphs have such geometric representations. In this talk, we show that comparable box representations behave well under several common operations on graphs. This leads to a proof that every proper minor-closed class of graphs has finite comparable box dimension. Based on joint work with Zdeněk Dvořák, Daniel Goncalves, Abhiruk Lahiri and Torsten Ueckerdt.

Emplois - Stages


GT Graphes et Optimisation


edit SideBar

Blix theme adapted by David Gilbert, powered by PmWiki