Graphs and networks encode many kinds of useful structures from abstract as well as practical applications. If we want to divide a graph into connected parts, a spanning tree is a natural device because deleting a single edge will induce a connected bipartition. Despite a huge literature on spanning trees supported by lots of fast algorithms, many basic questions are still wide open. I'll talk about spindly trees, bushy trees, and applications to civil rights.

Zoom link: https://umich.zoom.us/j/92772750713
Speaker(s): Moon Duchin (Tufts University)