The Game Saturation Number
报告题目(Title)：The Game Saturation Number
报告人(Speaker)：陆玫 (清华大学)
地点(Place)：后主楼1124
时间(Time)：2019年6月10日15:30-16:30
邀请人(Inviter)：徐敏
报告摘要
Given a family F, a host graph H and a subgraph G of H. G is called F-saturated relative to H, if G have no subgraph lies in F but adding any edge belongs to E(H)-E(G) to G makes at least one subgraph of G belongs to F. In the F-saturation game on H, players Max and Min alternately add edges of H to G, avoiding subgraphs in F, until G becomes F-saturated relative to H. They aim to maximize or minimize the length of the game, respectively. The game saturation number satg(F;H) (resp. the Min-start game saturation number satg'(F;H)) is the number of edges chosen when Max starts the game (resp. when Min starts the game) and both players play optimally. In this talk, we give the exact value of satg(P5;H) and satg'(P5;H) when H is Kn and Km,n, respectively.
