报告题目：Some problems and recent progress on matching covered graphs

报告人：冯星（集美大学 副教授）

报告时间：2025年8月18日（星期一） 下午16:00-16:30

地点：明理楼426

报告摘要： A graph is called {\it matching covered} if it is connected, has at least one edge and each of its edges is contained in some perfect matching. Lov\'asz proved that every matching covered graph may be decomposed into a unique list of bricks (3-connected bicritical graphs) and braces (2-extendable bipartite graphs). The importance of bricks and braces stems from the fact that several problems from matching theory can be reduced to bricks and braces (for example, computing the dimension of the linear hull and lattice of incidence vectors of perfect matchings, or characterizing Pfaffian graphs). This talk contains progress on minimal bricks and minimal braces and some open problems.

报告人简介：

冯星，男，集美大学副教授，硕士生导师，福建省运筹学会理事。2018年博士毕业于厦门大学，2017年8月至2018年8月于美国佐治亚州立大学访学一年。主要从事匹配理论的研究工作。近几年在包括Journal of Combinatorial Theory, Series B、Journal of Graph Theory、SIAM Journal on Discrete Mathematics、The Electronic Journal of Combinatorics与Discrete Mathematics等多种国际SCI检索的期刊上发表论文30余篇。