BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1251
DTSTAMP:20230914T125956Z
SUMMARY:On The Linear Arboricity Conjecture
DESCRIPTION:Speaker: Sreejata Kishor  Bhattacharya\n\nAbstract: \nA linear 
 forest is a forest in which every connected component is a line. The linea
 r arboricity of an undirected graph is the minimum t such that the edge se
 t can be partitioned into t subsets\, each of which forms a linear forest.
 \n\nHarari introduced this quantity as one of the covering invariants of g
 raphs. Harari\, Exoo and Akiyama (1981) made the following conjecture: the
  linear arboricity of any d regular graph is ceil(d+1)/2 (the lower bound 
 is easy to prove\; the non-trivial part is the upper bound).\n\nAlon prove
 d in 1988 that the linear arboricity of a d regular graph is at most d/2 +
  O(d^{3/4+\\epsilon}) for any $\\epsilon > 0$. The proof uses Lovasz Local
  Lemma and probabilistic method in very unexpected situations. We shall pr
 esent this proof.\n\nLink to paper: https://link.springer.com/article/10.1
 007/BF02783300\n
URL:https://www.tcs.tifr.res.in/web/events/1251
DTSTART;TZID=Asia/Kolkata:20221111T160000
DTEND;TZID=Asia/Kolkata:20221111T170000
LOCATION:A201
END:VEVENT
END:VCALENDAR