报告题目:Density of -critical signed graphs
报告主讲人:南开大学王周宁馨
报告时间:11月17日10:30-11:30
报告地点:腾讯会议号167-795-578
报告摘要:In this talk, we shall show that every n-vertex -critical signed graph has at leastedges, and that this bound is asymptotically tight. It follows that every signed planar or projective-planar graph of girth at least 6 is circular 3-colorable,and for the projective-planar case, this girth condition is best possible. This is joint work with Laurent Beaudou, Penny Haxell, Kathryn Nurse, and Sagnik Sen.
报告人简介:王周宁馨,南开大学数学科学学院讲师。2016年本科毕业于山东大学,2018年和2019年获得索邦大学和上海交通大学硕士学位,2022年5月于巴黎西岱大学获得博士学位。主要研究图与符号图的同态、染色与流理论,成果发表在J. Comb. Theory, Ser. B、SIAM J. Discret. Math.、J. Graph Theory、Electron. J. Comb.等杂志。