"Decomposing Graphs" Heather Gavlas, Grand Valley State University
A decomposition of a graph is a partition of its edge set into nonempty subsets. When each subset induces the same graph H, then the decomposition is called an H-decomposition. Decompositions of graphs have applications in such diverse fields as DNA sequencing, drug design, computer security, and scheduling problems. In this talk, we will explore various decompositions of the complete graph.
