BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Arvind Kumar (IIT Delhi)
DTSTART:20201007T053000Z
DTEND:20201007T063000Z
DTSTAMP:20260423T021351Z
UID:CATGT/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CATGT/12/">R
 egularity of binomial edge ideals</a>\nby Arvind Kumar (IIT Delhi) as part
  of Applications of Combinatorics in Algebra\, Topology and Graph Theory\n
 \n\nAbstract\nThis talk is going to be about the regularity of binomial ed
 ge ideals. We will\ndiscuss a combinatorial proof of regularity upper boun
 d for binomial edge ideals given by\nMatsuda and Murai. There are two regu
 larity upper bound conjectures for binomial edge\nideals. We will be discu
 ssing these two conjectures. Saeedi Madani and Kiani conjectured\nthat the
  regularity of the binomial edge ideal of a graph is bounded above by the 
 number\nof cliques of that graph. Hibi and Matsuda conjectured that the re
 gularity of the binomial\nedge ideal of a graph is bounded above by the de
 gree of h polynomial of that graph.\n
LOCATION:https://researchseminars.org/talk/CATGT/12/
END:VEVENT
END:VCALENDAR