報(bào) 告 人：馬杰 教授

報(bào)告題目：Kohayakawa-Nagle-Rodl-Schacht conjecture for subdivisions

報(bào)告時(shí)間：2025年02月24日（周一）下午2：00

報(bào)告地點(diǎn)：靜遠(yuǎn)樓1508會(huì)議室

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

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

      馬杰，中國(guó)科學(xué)技術(shù)大學(xué)數(shù)學(xué)科學(xué)學(xué)院教授、博導(dǎo)。主要從事組合圖論領(lǐng)域的研究工作及其在理論計(jì)算機(jī)和信息科學(xué)中的應(yīng)用。入選海外高層次人才青年項(xiàng)目、基金委國(guó)家優(yōu)青項(xiàng)目、杰青項(xiàng)目；曾獲中國(guó)工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)應(yīng)用數(shù)學(xué)青年科技獎(jiǎng)、國(guó)際組合學(xué)及其應(yīng)用協(xié)會(huì)2020年Hall Medal等獎(jiǎng)項(xiàng)，現(xiàn)任美國(guó)工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)離散數(shù)學(xué)雜志編委。

報(bào)告摘要：

      The Kohayakawa-Nagle-Rodl-Schacht (KNRS) conjecture asserts that for any graph H, locally dense graphs contain asymptotically at least the number of copies of H found in a random graph with the same edge density. In this talk, I will introduce some recent new results about the well-known KNRS conjecture, with a specific focus on graph subdivisions. This talk is based on the joint work with two Ph.D students at USTC: Hao Chen and Yupeng Lin..