应张和平教授和李秋丽副教授邀请，闽南师范大学数学与统计学院卢福良教授访问我校并做学术报告如下。

报告题目：Tight cuts in matching covered graphs

时间：7月10日下午16:00

地点：城关校区理工楼631报告厅

腾讯会议号：777-935-705

报告摘要：An edge cut C of a graph G is tight if |C ∩M |=1 for every perfect matching M of G . Barrier cuts and 2-separation cuts, also referred to ELP-cuts, are two important types of tight cuts in matching covered graphs. Edmonds, Lovász and Pulleyblank [Brick decompositions and the matching rank of graphs, Combinatorica2(3) (1982) 247-274] proved that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Confirming a conjecture of Carvalho, Lucchesi, and Murty, Chen et. al. [Laminar tight cuts in matching covered graphs, J. Comb. Theory, Ser. B, 150 (2021) 177-194]show that if C is a nontrivial tight cut of a matching covered graph G , then G has a C -sheltered nontrivial barrier or a 2-separation cut which is laminarwith C . In this talk, I will present a complete characterization of nontrivial tight cutsin matching covered graphs.

欢迎广大师生参加！

报告人简介

福建省闽江学者特聘教授。曾入选福建省百千万人才工程和主持省杰青项目。主要研究兴趣是图的匹配理论及相关问题，目前正在主持国家自然科学基金委面上项目。在J. Combin. Theory Ser. B,SIAM J. Discrete Math., Journal of Graph Theory，Electron. J. Comb.，Discrete Math.等杂志发表论文 50 余篇。

数学与统计学院

甘肃应用数学中心

萃英学院

2025年7月9日