澳门永利赌场龙-澳门永利赌场现况-网上赌博网址

報(bào)告題目：On minimal k-factor-critical planar graphs

報(bào)告時(shí)間：2024年4月12日（星期五）上午8:30-9:30

報(bào)告地點(diǎn)：理學(xué)院B315

主辦單位：理學(xué)院

報(bào)告人：盧福良 

報(bào)告人簡(jiǎn)介：

盧福良，福建省閩江學(xué)者特聘教授，曾入選福建省百千萬(wàn)人才工程。主要研究方向是圖的匹配理論及相關(guān)問(wèn)題。在J.Combin.Theory Ser.B,SIAM J.Discrete Math.,Journal of Graph Theory，Electron.J.Comb.，Discrete Math.等雜志發(fā)表論文30余篇。

報(bào)告內(nèi)容簡(jiǎn)介：

A graph G of order n is said to be k-factor-critical (0< k < n) if the removal of any k vertices results in a graph with a perfect matching. A k-factor-critical graph G is minimal if G-e is not k-factor-critical for any edge e in G. In 1998, Favaron and Shi posed the conjecture that every minimal k-factor-critical graph is of minimum degree k+1. We confirm the conjecture for planar graphs.(Joint work with Qiuli Li and Heping Zhang)