## 学术预告 首页  >  学术科研  >  学术预告  >  正文

“两校名师讲堂”系列报告第327期-tP3-Saturation Graphs

For fixed graphs F and H, a graph $G\subseteq F$ is H-saturated if there is no copy of H in G, but for any edge$e\in E(F)\setminus E(G)$, there is a copy of H in G+e. The saturation number of H in F, denoted $sat(F,H)$, is the minimum number of edges in an H-saturated subgraph of F. In thistalk,I will give a resultonsat(K_n,tP_3).