Saturation Numbers of Graphs
数学专题报告
报告题目(Title)：Saturation Numbers of Graphs
报告人(Speaker)：陆玫 教授 (清华大学)
地点(Place)：后主楼1220
时间(Time)：2023 年 5 月 26 日(周五), 15:30-16:30
邀请人(Inviter)：徐敏
报告摘要
A graph G is called an H-saturated if G does not contain H as a subgraph, but the addition of any edge between two nonadjacent vertices in G results in a copy of H in G. The saturation number sat(n,H) is the minimum number of edges in G for all H-saturated graphs G of order n. For a graph F, let mF denote the disjoint union of m copies of F. In 2011, Faudree, Faudree and Schmitt proposed a problem that is to determine sat(n,mPk) for all m and k. In this talk, I will give some results on sat(n,mP3).
主讲人简介
陆 玫，1993年7月在中国科学院数学与系统科学研究院获博士学位，现为清华大学数学科学系教授，博士生导师，主要从事运筹学、图论与组合优化方面的研究。
