About the speakerI am a PhD student at the School of Mathematical Science, Peking University. My supervisor is Prof. Yuan Zhang. Currently, my research interests include some stochastic models related to random walks, such as random interlacements, Gaussian free field, and diffusion-limited aggregation.AbstractWe prove that for the critical level-set of Gaussian free field on the metric graph g...
AbstractA graph is called k-critical if its chromatic number is k but any proper subgraph has chromatic number less than k. There have been extensive reseach on k-critical graphs over the past decades, yet several basic problems remains widely open. One of such problems is to determine the maximum number of edges in an n-vertex k-critical graph. In this talk, we will discuss some recent results...