报告题目 (Title)：The number of maximum dissociation sets in trees（树中最大分离集的数目）
报告人 (Speaker)：史永堂 教授（南开大学）
报告时间 (Time)：2022年8月27日 (周六) 15:00
报告地点 (Place)：腾讯会议（会议号：889-804-896）
邀请人(Inviter)：何卓衡
主办部门：理学院数学系
报告摘要：
A subset of vertices is a maximum independent set if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. In this talk, we will introduce the result on the maximum number of maximum dissociation sets in trees. Joint work with Jianhua Tu and Zhipeng Zhang.
