BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Liana Yepremyan (Emory University)
DTSTART:20220409T140000Z
DTEND:20220409T150000Z
DTSTAMP:20260423T021217Z
UID:YMC/34
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/YMC/34/">Edg
 e-decomposition of cubic graphs into two isomorphic linear forests</a>\nby
  Liana Yepremyan (Emory University) as part of Yerevan Mathematical Colloq
 uium\n\n\nAbstract\nA cubic graph is one where every vertex has degree thr
 ee. A linear forest is a disjoint union of paths. It is known that the edg
 e set of every cubic graph can be partitioned into two linear forests wher
 e each path is short (of constant size). A conjecture of Wormald asks for 
 such a partition where the two forests are isomorphic (we no longer insist
  on having short paths\, although that is also an open question). Note tha
 t this also can be phrased as an edge-colouring question. Is it possible t
 o colour the edge set of a cubic graph by red and blue such that the two m
 onochromatic components induce isomorphic linear forests? Recently we prov
 ed this for all connected graphs on sufficiently large number of vertices.
  In the second part of this talk\, I will give some ideas used in  the pro
 of and demonstrate how we prove an approximate result (as a first step to 
 our proof of the general result). This is joint work with Gal Kronenberg\,
  Shoham Letzter and Alexey Pokrovskiy.\n\nRescheduling: The talk was origi
 nally scheduled for Apr 2nd. It is now rescheduled to Apr 9th.\nTalk host:
  Petros Petrosyan\n
LOCATION:https://researchseminars.org/talk/YMC/34/
END:VEVENT
END:VCALENDAR