BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Fractional decompositions of dense graphs - Richard Montgomery (Un
 iversity of Cambridge)
DTSTART:20171109T143000Z
DTEND:20171109T153000Z
UID:TALK86261@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:It is difficult to determine when a graph G can be edge-covere
 d by edge-disjoint copies of a fixed graph F. That is\, when it has an F-d
 ecomposition. However\, subject to some simple divisibility conditions\, a
  high minimum degree is known to force such a decomposition in large graph
 s. Recent research has strongly linked reducing the degree bound required 
 here to comparable results for a\nrelaxation of this problem\, where a fra
 ctional decomposition is sought.\n\nI will show how a relatively simple ra
 ndom process can give a good starting approximation to a fractional decomp
 osition\, and how it subsequently can be corrected. This improves the best
  known bounds until the permitted discrepancy in degree is within a consta
 nt factor of the conjectured maximum.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR