Title: The k-independence number of graph productsSpeaker: Hidde Koerts Affiliation: University of Waterloo Location: MC 5417
Abstract: The k-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than k, generalizing the standard independence number. In this talk, I will discuss well-known sharp bounds on the independence number of graph products, and extend some of these bounds to the k-independence number. Specifically, we will cover the Cartesian, tensor, strong, and lexicographic products.
Joint work with Aida Abiad.