Date & time: Wednesday, 20 September 2017 at 12:10PM - 1:10PM
Abstract: For a given graph G, a subset A of V(G) is independent if no two vertices in A are adjacent. Some time ago, Erdos and Moser asked: what’s the maximum possible number of maximal independent sets in a graph G with n vertices. In this talk we will investigate the answer to this question, and some other related questions.
In general, the seminars will be on Wednesdays at 12:10 in Hill 701 which is the Graduate Student Lounge