BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Combinatorics Seminar
SUMMARY:Fractional decompositions of dense graphs - Richar
d Montgomery (University of Cambridge)
DTSTART;TZID=Europe/London:20171109T143000
DTEND;TZID=Europe/London:20171109T153000
UID:TALK86261AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/86261
DESCRIPTION:It is difficult to determine when a graph G can be
edge-covered by edge-disjoint copies of a fixed g
raph F. That is\, when it has an F-decomposition.
However\, subject to some simple divisibility cond
itions\, a high minimum degree is known to force s
uch a decomposition in large graphs. Recent resear
ch has strongly linked reducing the degree bound r
equired here to comparable results for a\nrelaxati
on of this problem\, where a fractional decomposit
ion is sought.\n\nI will show how a relatively sim
ple random process can give a good starting approx
imation to a fractional decomposition\, and how it
subsequently can be corrected. This improves the
best known bounds until the permitted discrepancy
in degree is within a constant factor of the conje
ctured maximum.\n
LOCATION:MR12
CONTACT:Andrew Thomason
END:VEVENT
END:VCALENDAR