学术报告

题      目： The (fractional) matching preclusion number of graphs

报  告  人：陆玫   教授  (邀请人：尤利华 )

                                 清华大学

时      间：2022-10-21 08:30-10:30

腾 讯 会 议：588-915-210

报告人简介:

       陆玫，1993年7月在中国科学院数学与系统科学研究院获博士学位，现为清华大学数学科学系教授，博士生导师，主要从事运筹学、图论与组合优化方面的研究。现任清华大学数学科学系计算数学与运筹学研究所所长。

摘      要：

       Let G be a graph. A subset F of E(G) is a matching preclusion set if G-F has no almost-perfect matchings or perfect matchings. The matching preclusion number of G is the minimum size of matching preclusion sets of G. The fractional matching preclusion number of a graph G, denoted by fmp(G), is the minimum number of edges whose deletion results in a graph with no fractional perfect matching.
 In this talk, some results on the (fractional) matching preclusion number of the Cartesian product of two simple graphs and the complete k-partite graphs were given. This work is joint with Yu Luan and Yi Zhang.