Title: Gluing Graphs
Speaker: Robert DeMarco, Rutgers University
Date: Monday, November 5, 2012 11:00am - 12:00pm
Location: DIMACS Center, CoRE Bldg, Room 431, Rutgers University, Busch Campus, Piscataway, NJ
Abstract:
We say a family of connected graphs G_1,...,G_k is uniquely composable if there exists a graph H and a unique choice of subgraphs H_1,...,H_k of H such that H_i is isomorphic to G_i for all i and the union of H_1,...,H_k is H. In this talk I will explain why this notion of unique composability is of interest. I will then discuss which families of size 2 are uniquely composable, before describing conjectures and ideas about larger sized families. (Joint work with Amanda Redlich)
DIMACS/CCICADA Interdisciplinary Series, Complete Fall Calendar 2012