AbstractDetermining the chromatic number of a graph is a difficult but important problem. Hence, it is not surprising that a variety of questions in Graph Theory concern the search for meaningful upper bounds for the chromatic number of certain families of graphs. One type of graph family that received considerable attention is that of H-free graphs, that is, the family of graphs G which do not...
Algebraic Geometry SeminarOrganizers:Caucher Birkar,贾甲Speaker:Yang He (BIMSA)Time:Fri., 15:30-16:30, Sept. 27, 2024Online:Zoom Meeting ID: 262 865 5007Passcode: YMSC 线下:ShuangQing B7Title:Two generalization of the Sarkisov ProgramAbstract:I will explain how to generalize the Sarkisov Program following the idea of Shokurov, and discuss some applications and computations in the surfac...