講座主題:Anti-Ramsey problems in complete bipartite graphs
專家姓名:陸玫
工作單位:清華大學(xué)
講座時(shí)間:2018.11.02下午16:00
講座地點(diǎn):數(shù)學(xué)院大會(huì)議室
主辦單位:煙臺(tái)大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院
內(nèi)容摘要:
A subgraph $H$ of an edge-colored graph $G$ is rainbow if all of its edges have different colors. The anti-Ramsey number is the maximum number of colors in an edge-coloring of $G$ with no rainbow copy of $H$. Originally a complete graph was considered as $G$. In this talk, we consider a complete bipartite graph as the host graph and discuss some results for the graph $H$ being hamiltonian cycle, perfect matching and spanning tree, respectively.
主講人介紹:
陸 玫,,1993年7月在中國(guó)科學(xué)院系統(tǒng)科學(xué)研究所獲博士學(xué)位,,現(xiàn)為清華大學(xué)數(shù)學(xué)科學(xué)系教授,,博士生導(dǎo)師,,主要從事運(yùn)籌學(xué),、圖論與組合優(yōu)化方面的研究,,發(fā)表學(xué)術(shù)論文八十余篇?,F(xiàn)任清華大學(xué)數(shù)學(xué)科學(xué)系計(jì)算數(shù)學(xué)與運(yùn)籌學(xué)研究所所長(zhǎng),,中國(guó)運(yùn)籌學(xué)會(huì)圖論組合分會(huì)副理事長(zhǎng),,中國(guó)工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)圖論組合及應(yīng)用專業(yè)委員會(huì)秘書長(zhǎng),,中國(guó)組合數(shù)學(xué)與圖論學(xué)會(huì)理事。