报告题目： Some problems and results on matching covered graphs
时 间：2024-03-17 (星期日)14:00
地 点：科研楼18号楼1102
主 办：数学与统计学院、分析数学及应用教育部重点实验室、福建省分析数学及应用重点实验室、福建省应用数学中心（福建师范大学）
参加对象：感兴趣的老师和研究生
报告摘要：A graph is called matching covered if it is connected, has at least one edge and each of its edges is contained in some perfect matching. Lovász 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). In this talk, we report recent progress on bricks and braces and some open problems.
报告人简介：张莲珠，厦门大学数学科学学院教授，博士生导师。研究方向主要为图论及其应用。主持、参与多项国家自然科学基金项目的研究。已在《Journal of Combinatorial Theory, Series B》、《Journal of Graph Theory》、《SIAM Journal on Discrete Mathematics》、《The Electronic Journal of Combinatorics》、《Discrete Mathematics》、《Discrete Applied Mathematics》等学术期刊发表论文数十篇，研究成果曾获福建省科学技术二等奖。