报告地点：行健楼学术活动室526
ABSTRACT：A graph is covered by a set of its subgraphs if each edge of the graph is contained in at least one of the subgraphs. The Four Color Problem is equivalent to covering a planar graph by two even subgraphs. (A graph is even if each vertex is incident with an even number of edges.) A graph is matching covered if each edge is covered by a perfect matching. For a matching covered graph G, how many perfect matchings are needed to cover all the edges of G? This is a very difficult open problem. This talk focuses on covering graphs by perfect matchings, even subgraphs, paths, or circuits.
报告人简介：范更华，福州大学教授。1988年获加拿大滑铁卢大学博士学位。入选中国科学院1996年度“百人计划”从美国亚利桑那州立大学回国工作。范更华主要从事图论基础理论及其应用研究，致力于图论在芯片设计EDA软件中的应用。获1998年度国家杰出青年科学基金资助、2005年度国家自然科学二等奖（独立完成人）、2022年度教育部自然科学一等奖（第一完成人）；曾任福州大学副校长、中国数学会组合数学与图论专业委员会主任、全国组合数学与图论研究会理事长、中国运筹学会副理事长；现任福州大学离散数学及其应用教育部重点实验室主任、福建省数学会理事长。自1997年起，一直担任国际图论界权威期刊《Journal of Graph Theory》执行主编（Managing Editor）。
