Title: On the k-independence number of graphs
Speaker：Aida Abiad, Maastricht University
Place：Room 1418, School of Mathematical Sciences, Management Research Building, East Campus
In this talk I shall present recent spectral bounds on the k-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than k. The previous bounds known in the literature follow as a corollary of our main results. We show that for most cases our bounds outperform the previous known bounds. Some infinite families of graphs where the bounds are tight are also presented. This is joint work with G. Coutinho and M.A. Fiol.