Pablo Blanco, Rutgers University

Abstract

Given a graph H, which we wish to exclude (maybe as a minor or as an induced subgraph), can we find some set of 'rules' (graph operations) so that we can build (vertex by vertex) any graph G that does not 'contain' H? With a broad enough definition of graph operations, we can, trivially. However, we want nicer graph operations so that we can call these 'constructions'. In this talk, we (briefly) discuss some properties we might want a construction to have and a survey of graph constructions.

See: https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html