BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Keri Sather-Wagstaff (Clemson University)
DTSTART:20220225T130000Z
DTEND:20220225T140000Z
DTSTAMP:20260423T020958Z
UID:VCAS/123
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/VCAS/123/">M
 onomial Ideals Arising from Graph Domination Problems</a>\nby Keri Sather-
 Wagstaff (Clemson University) as part of IIT Bombay Virtual Commutative Al
 gebra Seminar\n\n\nAbstract\nGraph domination problems are ubiquitous in g
 raph theory. In the broadest terms\, they ask how one can ‘observe’ an
  entire graph by designating a certain list of vertices\, following a pros
 cribed list of rules. An example of this is the vertex covering problem wh
 ich happens to describe the irredundant irreducible decomposition of the e
 dge ideal of a graph. In this talk\, we will survey recent work with vario
 us collaborators on other monomial ideal constructions that arise from oth
 er graph domination problems\, including one coming from electrical engine
 ering.\n
LOCATION:https://researchseminars.org/talk/VCAS/123/
END:VEVENT
END:VCALENDAR