报告题目 (Title)：图的饱和数 (Saturation Number of Graphs)
报告人 (Speaker)：陆玫教授（清华大学）
报告时间 (Time)：2023年06月20日(周二) 09:00
报告地点 (Place)：腾讯会议：255-683-755
邀请人(Inviter)：袁西英
报告摘要：For fixed graphs G and H, a graph G is H-saturated if there is no copy of H in G, but for any edge e not in E(G), there is a copy of H in G+e. The saturation number of H in G, denoted sat(G, H), is the minimum number of edges in an H-saturated subgraph of G. In this talk, I will give some results on sat(Kn, H), where H=tP3 or tK1,k.