- Series
- Graph Theory Working Seminar
- Time
- Wednesday, September 26, 2018 - 4:30pm for 1.5 hours (actually 80 minutes)
- Location
- Skiles 006
- Speaker
- Dantong Zhu – Georgia Tech
- Organizer
- Xingxing Yu
A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2+Ω(√m), and this is best possible. We will continue our discussion about recent results on analogues of Edwards’ result and related problems in hypergraphs.