The Generalized Györi-Lovasz Theorem

Graph Theory Seminar
Thursday, April 19, 2018 - 13:30
1 hour (actually 50 minutes)
Skiles 005
Math, GT
Györi and Lovasz independently proved that a k-connected graph can be partitioned into k subgraphs, with each subgraph connected, containing a prescribed vertex, and with a prescribed vertex count. Lovasz used topological methods, while Györi found a purely graph theoretical approach. Chen et al. later generalized the topological proof to graphs with weighted vertices, where the subgraphs have prescribed weight sum rather than vertex count. The weighted result was recently proven using Györi's approach by Chandran et al. We will use the Györi approach to generalize the weighted result slightly further. Joint work with Robin Thomas.