報(bào)告時(shí)間：2024年6月11日下午16:30

報(bào)告地點(diǎn)：數(shù)學(xué)與信息學(xué)院數(shù)學(xué)系715教室

報(bào)告題目：Construction, Extension and Path extendability of Near-Homogeneous Tournaments

報(bào)告摘要： A homogeneous tournament is a tournament with  vertices that every arc is contained in exactly  cycles of length . Homogeneous tournaments are the first class of tournaments that are proved to be path extendable, which means that every nonhamiltonian path  in such a tournament  can be extended to a path  with the same initial and terminal vertex and  for a certain vertex . A generalized class of graph is that of near-homogeneous tournaments with  vertices, in which every arc is contained in  or  cycles of length . We raise a new method to construct near-homogeneous tournaments with  vertices. We also show that the definition of near-homogeneous tournament can be extended to tournaments with an even number of vertices. Finally we verify path extendability of near-homogeneous tournaments.

個(gè)人簡介：

張贊波現(xiàn)為廣東財(cái)經(jīng)大學(xué)統(tǒng)計(jì)與數(shù)學(xué)學(xué)院教授,，先后在中山大學(xué)和荷蘭特文特大學(xué)（University of Twente）獲得計(jì)算機(jī)和應(yīng)用數(shù)學(xué)方向博士學(xué)位,，曾為廣東省千百十人才培養(yǎng)工程省級(jí)培養(yǎng)對(duì)象,。他主要從事圖論及其算法等方面研究工作,，在SIAM J. on Discrete Mathematics,，J. of Graph Theory 等著名國際學(xué)術(shù)期刊上發(fā)表論文約四十篇,，完成學(xué)術(shù)著作兩部,，在圖的匹配理論,，路圈理論,，圖劃分算法和連通度算法等方向上取得系列成果,，部分基礎(chǔ)性成果被相關(guān)領(lǐng)域的專著和綜述所引用。他主持完成廣東省自然科學(xué)基金項(xiàng)目兩項(xiàng),，廣東省重點(diǎn)科研項(xiàng)目一項(xiàng),，現(xiàn)主持在研廣東省自然科學(xué)基金兩項(xiàng)。(詳見個(gè)人網(wǎng)頁http://shx.gdufe.edu.cn/2022/0710/c9459a163885/page.htm)