数苑博雅讲座（59）：Covering a Graph by its Subgraphs
来源：
发布时间：2026-05-29
报告时间：- 2025年12月24日 （周三）上午9:30-10:30
- 报告地点：
- 国交2栋315会议室
- 报告人：
- 范更华
- 报告人单位：
- 福州大学
- 邀请人：
- 李书超
- 摘要：
- 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.
