- Series
- Graph Theory Seminar
- Time
- Thursday, November 9, 2017 - 1:30pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Shijie Xie – Math, GT
- Organizer
- Robin Thomas
Let G be a graph containing 5 different vertices a0, a1, a2, b1 and
b2. We say that (G, a0, a1, a2, b1, b2) is feasible if G contains
disjoint connected subgraphs G1, G2, such that {a0, a1, a2}⊆V(G1) and
{b1, b2}⊆V(G2). In this talk, we will prove the
existence of 5-edge configurations in (G, a0, a1, a2, b1, b2). Joint
work with Changong Li, Robin Thomas, and Xingxing Yu.