BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:D. Yogeshwaran (ISI Bangalore)
DTSTART:20201112T053000Z
DTEND:20201112T063000Z
DTSTAMP:20260423T053016Z
UID:CATGT/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CATGT/18/">E
 dge ideals of Random Graphs</a>\nby D. Yogeshwaran (ISI Bangalore) as part
  of Applications of Combinatorics in Algebra\, Topology and Graph Theory\n
 \n\nAbstract\nIn this talk\, we shall look at four properties of edge idea
 ls of Erdos-Renyi random graphs. Namely\, we shall consider asymptotics fo
 r linear resolution\, linear presentation\, regularity and unmixedness. Th
 ese properties have very explicit characterization in terms of graph-theor
 etic properties such as co-chordality\, induced matching number and unique
 ness of minimal vertex cover. In this talk\, we shall discuss asymptotics 
 for the latter properties of Erdos-Renyi random graphs and their consequen
 ces for random edge ideals. Though the random graph theory results will be
  stated in a self-contained manner\, the interest in these results is due 
 to their connection to edge ideals.\n\nEdge ideals and related notions sha
 ll be introduced in Arindam Banerjee's talk on November 11th and I shall o
 nly recall them very briefly. On the random graph side\, I shall assume kn
 owledge of graph theory and basic probability.\n\nThe talk is based on a j
 oint work with Arindam Banerjee \; https://arxiv.org/abs/2007.08869\n
LOCATION:https://researchseminars.org/talk/CATGT/18/
END:VEVENT
END:VCALENDAR