BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An approximate version of Jackson's conjecture - Yani Pehova (Univ
 ersity of Warwick)
DTSTART:20191121T143000Z
DTEND:20191121T153000Z
UID:TALK126700@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:In 1981 Jackson showed that the diregular bipartite tournament
  (a complete bipartite graph whose edges are oriented so that every vertex
  has the same in- and outdegree) contains a Hamilton cycle\, and conjectur
 ed that in fact the edge set of it can be partitioned into Hamilton cycles
 . We prove an approximate version of this conjecture: For every $c > 1/2$ 
 and $\\varepsilon > 0$ there exists $n_0$ such that every $cn$-regular bip
 artite digraph on $2n\\geq n_0$ vertices contains $(1 - \\varepsilon)cn$ e
 dge-disjoint Hamilton cycles.
LOCATION:MR12
END:VEVENT
END:VCALENDAR