»ã±¨±êÌâ (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.