講座主題：The Berge-Fulkerson coloring for some permutation snarks
專(zhuān)家姓名：郝榮霞
工作單位：北京交通大學(xué)
講座時(shí)間：2022年5月28日 14:00
講座地點(diǎn)：騰訊會(huì)議：574689876
主辦單位：煙臺(tái)大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院
內(nèi)容摘要：
It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. The BergeFulkerson conjecture holds for 3-edge-colorable cubic graphs. A snark is a cyclically 4-edge connected cubic graph of girth at least 5 admitting no 3-edge coloring. In this talk, the BergeFulkerson conjecture is verified for some permutation snarks including an infinite family of cyclically 5-edge connected snarks constructed by J. Hagglund and A. Hoffmann-Ostenhof. This is a joint work with Siyan Liu, Cun-Quan Zhang and Zhang Zhang.
主講人介紹：
郝榮霞，北京交通大學(xué)教授，博士生導(dǎo)師，主要從事圖論與網(wǎng)絡(luò)的研究。2008年獲北京運(yùn)籌學(xué)會(huì)青年優(yōu)秀論文一等獎(jiǎng)。主持和參加國(guó)家自然科學(xué)基金面上項(xiàng)目多項(xiàng)，參加國(guó)家自然科學(xué)基金重點(diǎn)項(xiàng)目一項(xiàng)。獲評(píng)北京交通大學(xué)“智瑾獎(jiǎng)教金優(yōu)秀青年教師”、“巾幗十杰”、“畢業(yè)生我最敬愛(ài)的老師”、“教學(xué)名師”等榮譽(yù)。在Information Sciences、IEEE Transactions on Computer、IEEE Transactions on Parallel and Distributed Systems、Journal of GraphTheory”等期刊發(fā)表論文90余篇。擔(dān)任中國(guó)運(yùn)籌學(xué)會(huì)圖論組合分會(huì)第五屆理事；國(guó)際期刊International Journal of Computer Mathematics: Computer Systems Theory編委；美國(guó)數(shù)學(xué)會(huì) “Mathematical Reviews”評(píng)論員。
