報(bào) 告 人：李瞳 助理研究員

報(bào)告題目：Two extremal problems in uniform hypergraphs

報(bào)告時(shí)間：2025年5月22日（周四）下午14:30

報(bào)告地點(diǎn)：騰訊會(huì)議772-603-575

主辦單位：數(shù)學(xué)與統(tǒng)計(jì)學(xué)院、數(shù)學(xué)研究院、科學(xué)技術(shù)研究院

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

     李瞳，中國(guó)科學(xué)院數(shù)學(xué)與系統(tǒng)科學(xué)研究院助理研究員。博士畢業(yè)于山東大學(xué)，后入職中國(guó)科學(xué)院數(shù)學(xué)與交叉科學(xué)中心從事博士后研究工作，主要研究方向?yàn)闃O值組合、染色標(biāo)號(hào)和隨機(jī)圖過(guò)程，在JGT、EJC、JOCO等期刊發(fā)表多篇論文，主持國(guó)家基金委青年項(xiàng)目一項(xiàng)，參與國(guó)家基金委重點(diǎn)項(xiàng)目和科技部重點(diǎn)研發(fā)計(jì)劃各一項(xiàng)。

報(bào)告摘要：

                 In this talk, I will report some recent progress on two extremal problems in uniform hypergraphs. In the first part, we consider the rainbow Turán problem raised by Keevash, Mubayi, Sudakov and Verstra?te in 2007 and study the rainbow Turánnumber for hypergraph matchings and paths. In the second part, we consider the anti-Ramsey problem raised by Erd?s, Simonovits and Sós in 1975 and determine the anti-Ramsey number for some classical hypergraphs such as paths and cycles.These results are based on joint work with Hao Huang, Yucong Tang, Guanghui Wang, Guiying Yan and Wenling Zhou.