BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:http://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/London:20190628T140000
DTEND;TZID=Europe/London:20190628T150000
DTSTAMP:20260508T074206
CREATED:20190610T073147Z
LAST-MODIFIED:20190610T073147Z
UID:1254-1561730400-1561734000@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Extremal Cuts and Isoperimetry in Random Cubic Graphs
DESCRIPTION:Title: Extremal Cuts and Isoperimetry in Random Cubic Graphs\nSpeaker: Prof. Gregory B. Sorkin\nAffiliation: Dept of Mathematics\, The London School of Economics and Political Science (LSE)\nLocation: LT139 Huxley Building\nTime: 14:00 – 15:00 \nAbstract. The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics\, and also because the minimum bisection of (general) cubic graphs plays a role in the construction of efficient exponential-time algorithms\, and it seems likely that random cubic graphs are extremal. \nIt is known that a random cubic graph has a minimum bisection of size at most 1/6 times its order (indeed this is known for all cubic graphs)\, and we reduce this upper bound to below 1/7 (to 0.13993) by analyzing an algorithm with a couple of surprising features. We increase the corresponding lower bound on minimum bisection using the Hamilton cycle model of a random cubic graph. We use the same Hamilton cycle approach to decrease the upper bound on maximum cut. We will discuss some related conjectures.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-extremal-cuts-and-isoperimetry-in-random-cubic-graphs/
END:VEVENT
END:VCALENDAR