Seminar on Discrete Mathematics: Planar wheel-like bricks

  • A+

:卢福良(闽南师范大学)
:2024-07-24 15:00
:海韵园数理大楼686会议室

报告人:卢福良闽南师范大学

 间:202472415:00

 点:海韵园数理大楼686会议室

内容摘要:

An edge e in a matching covered graph G is removable if G-e is matching covered; a pair {e,f} of edges of G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are called removable classes, which was introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs.

A brick is a nonbipartite matching covered graph without nontrivial tight cuts. A brick G is wheel-like if G has a vertex h, such that every removable class of G has an edge incident with h. Lucchesi and Murty conjectured that every planar wheel-like brick is an odd wheel. In this talk, we will present some results about removable edges in a brick and a proof of this conjecture.

人简介

卢福良,闽南师范大学教授,福建省闽江学者特聘教授。重庆大学本科,2011年博士毕业于厦门大学,曾入选福建省“雏鹰计划”青年拔尖人才。主要研究图的匹配理论及相关问题。在J. Combin. Theory Ser. B, SIAM J. Discrete Math., Journal of Graph Theory, Electron. J. Comb., Discrete Math.等杂志发表论文40余篇。主持国家自然科学基金项目3项和福建省自然科学基金杰青项目等。

 

联系人:金贤安