【数学与统计及交叉学科前沿论坛------高端学术讲座第131场】

报告题目：Maximal and maximum induced matchings in connected graphs

报告人：龚世才教授  浙江科技大学

报告时间：2024年11月19日（周二）19:00-20:00

报告地点：腾讯会议 440-460-499

报告摘要：An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. In the paper [ J. H. Tu, Z. P. Zhang, and Y. T. Shi, The maximum number of maximum dissociation sets in trees, J. Graph Theory 96(2021), 472--489.], Tu et al. determined the trees which have the maximum number of maximum dissociation sets with fixed order.

We continue the above work and try to investigate the connected graph having the maximum number of maximum dissociation sets with fixed order. In particular, we determined the maximum number of maximal and maximum induced matchings in a connected graph of order $n$.

报告人简介：龚世才 博导、教授，浙江科技大学数学学科负责人，研究方向为代数图论、代数组合论及其应用。发表SCI检索论文60多篇，论文引用次数600多次，H指数为14。主持2项国家基金面上项目，4项省级项目。