BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Liana Yepremyan (Emory University) DTSTART:20220319T140000Z DTEND:20220319T150000Z DTSTAMP:20260423T052756Z UID:YMC/33 DESCRIPTION:Title: Par titioning cubic graphs into isomorphic linear forests\nby Liana Yeprem yan (Emory University) as part of Yerevan Mathematical Colloquium\n\n\nAbs tract\nA cubic graph is one where every vertex has degree three. A linear forest is a disjoint union of paths. It is known that the edge set of e very cubic graph can be partitioned into two linear forests where each pat h is short (of constant size). A conjecture of Wormald asks for such a par tition where the two forests are isomorphic (we no longer insist on having short paths\, although that is also an open question). Note that this als o can be phrased as an edge-colouring question. Is it possible to colour t he edge set of a cubic graph by red and blue such that the two monochro matic components induce isomorphic linear forests? Recently we proved this for all connected graphs on sufficiently large number of vertices. I wil l talk about the result and give some idea of the proof method. This is jo int work with Gal Kronenberg\, Shoham Letzter and Alexey Pokrovskiy.\n\nTa lk chair: Petros Petrosyan\n LOCATION:https://researchseminars.org/talk/YMC/33/ END:VEVENT END:VCALENDAR