應(yīng)yl7703永利官網(wǎng)張和平教授和徐守軍教授邀請(qǐng)，南開大學(xué)數(shù)學(xué)研究所李學(xué)良教授將于2020年8月4日進(jìn)行線上學(xué)術(shù)報(bào)告。

報(bào) 告：Rainbow disconnection of graphs

時(shí) 間：8月4日下午3:00

地 點(diǎn)：騰訊會(huì)議      

ID : 167 831 260      密碼 : 0804

摘要：Let $G$ be an edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges in $R$ are colored with a same color. An edge-colored graph $G$ is called rainbow disconnected if for every pair of vertices $u$ and $v$ of $G$, there exists a $u-v$ rainbow cut in $G$ separating them. For a connected graph $G$, the rainbow disconnection number of $G$, denoted by $rd(G)$, is defined as the smallest number of colors that are needed in order to make $G$ rainbow disconnected. This is a new chromatic number. However, it is different from classic chromatic numbers. It relates global condition of graphs, not just local structural conditions. In this talk we will summarize the main results on this new graph parameter. Some open questions are also presented.

歡迎廣大師生參加！

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

李學(xué)良，南開大學(xué)教授，1991年獲荷蘭屯特大學(xué)博士學(xué)位，1992年任教授，1996年任博士生導(dǎo)師?，F(xiàn)任南開大學(xué)杰出教授、組合數(shù)學(xué)中心副主任。中國(guó)工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)常務(wù)理事，天津市工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)理事長(zhǎng)，天津市數(shù)學(xué)會(huì)副理事長(zhǎng)。《Discrete Applied Mathematics》和《Graphs and Combinatorics》等10余種國(guó)際雜志編委。主要從事圖論與組合優(yōu)化、計(jì)算機(jī)科學(xué)理論方面的研究和教學(xué)工作。在本領(lǐng)域多種國(guó)際主流傳統(tǒng)學(xué)術(shù)期刊上發(fā)表論文300余篇，谷歌學(xué)術(shù)搜索7000余篇次被國(guó)內(nèi)外同行學(xué)者的論著引用。在Springer等國(guó)際出版社出版《Graph Energy》等著作10部，在高教出版社出版《組合優(yōu)化》等譯著2部。主持過國(guó)家自然科學(xué)基金面上項(xiàng)目10項(xiàng)，承擔(dān)過“973”項(xiàng)目2項(xiàng)和國(guó)家自然科學(xué)基金重點(diǎn)項(xiàng)目2項(xiàng)。

甘肅省應(yīng)用數(shù)學(xué)與復(fù)雜系統(tǒng)重點(diǎn)實(shí)驗(yàn)室

yl7703永利官網(wǎng)

萃英學(xué)院

2020年8月3日