Extendability of certain product graphs

A graph G of even order is k-extendable if it has at least 2k+2 vertices, contains a matching of size k, and if every k-matching is contained in a perfect matching of G. In the talk we will discuss k-extendability of Cartesian product graphs and lexicographic product graphs.

This is a joint work with Cemil Dibek, Tinaz Ekim, Didem Gözüpek, Štefko Miklavič and Martin Milanič.

Everyone is warmly welcomed and encouraged to attend.