BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Lower Bounds for Maximum Weight Bisections of Graphs with Bounded 
 Degrees. - Stefanie Gerke (Royal Holloway)
DTSTART:20240606T133000Z
DTEND:20240606T143000Z
UID:TALK217462@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:A bisection in a graph is a cut in which the number of vertice
 s in the two parts differ by at most 1. In this talk\, we discuss lower bo
 unds for the maximum weight of bisections of edge-weighted graphs with bou
 nded maximum degree. Our results improve a bound of Lee\, Loh\, and Sudako
 v (J. Comb. Th. Ser. B 103 (2013)) for (unweighted) maximum bisections in 
 graphs the maximum degree of which is either even or equals 3\, and graphs
  of (chromatic index) Class 1. We show that a tight lower bound for maximu
 m size of bisections in 3-regular graphs obtained by Bollob ́as and Scott
  (J. Graph Th. 46 (2004)) can be extended to weighted subcubic graphs.  Th
 is is joint work with Gregory Gutin\, Anders Yeo and Yacong Zhou.
LOCATION:MR12
END:VEVENT
END:VCALENDAR