Monomial Ideals Arising from Graph Domination Problems

Abstract: Graph domination problems are ubiquitous in graph theory. In the broadest terms, they ask how one can ‘observe’ an entire graph by designating a certain list of vertices, following a proscribed list of rules. An example of this is the vertex covering problem which happens to describe the irredundant irreducible decomposition of the edge ideal of a graph. In this talk, we will survey recent work with various collaborators on other monomial ideal constructions that arise from other graph domination problems, including one coming from electrical engineering.

Mathematics

Audience: advanced learners

IIT Bombay Virtual Commutative Algebra Seminar

Series comments: Note: To get meeting ID,fill the Google form on the web-site of the series sites.google.com/view/virtual-comm-algebra-seminar/home