报告题目：Removable edges in bricks

报 告 人：王艳教授（闽南师范大学）

报告时间：2024年11月6日  15:30-16:20

报告地点：格物楼数学中心528

报告摘要：

A connected nontrivial graph G is matching covered, if every edge of G is contained in a perfect matching of G. An edge e of a matching covered graph G is removable if G-e is still matching covered. Lovasz and Plummer introduced removable edges in connection with ear decompositions of matching covered graphs. A matching covered graph G is a brick if and only if G is 3-connected and for any two distinct vertices u and y of G, G-u-v has a perfect matching. The existence of removable edges, especially of special types, plays an important role in the generation of some bricks. In this talk, we introduce the related background and our results on removable edges in bricks.

报告人简介：

王艳，博士，教授，硕士生导师，福建省女科技工作者协会闽南师范大学分会会长，福建省运筹学会理事，闽南师范大学教师工作部（人事处）副部（处）长。目前，受教育部师范协同提质计划选派至怀化学院教务处挂职。主要从事图论及其应用的研究工作，在《Science China Mathematics》《Advances in Mathematics (China)》《Linear Algebra and its Application》《the Electronic Journal of Combinatorics》《Discrete Applied Mathematics》等国内外主要期刊发表论文二十余篇。主持、合作研究、参与科研项目11项（国家级3项，省级8项）和教改项目8项（省级3项，校级5项）。曾获第十四届福建省自然科学优秀学术论文三等奖；是福建省一流本科课程《概率论》的课程负责人，曾获“第二届全国高校数学微课程教学设计竞赛”华东赛区二等奖、“第三届福建省高校青年教师教学竟赛”自然科学基础组三等奖。