报告题目一:The genus of graphs and random graphs
报 告 人: 荆一凡
报告时间:2018年7月24日(周二)下午3:00-4:30
报告地点: 安徽大学磬苑校区数学科学学院H401
报告摘要: The genus of a graph G is the minimum integer h, such that G has an embedding on a surface of genus h. In this talk, I will give a brief introduction to graph genus problem in topological graph theory. Some recent results on the genus of random and quasirandom graphs will be discussed. This is joint work with Bojan Mohar.
报告题目二:On the genus of complete 3-uniform hypergraphs
报 告 人:荆一凡
报告时间:2018年7月25日(周三)下午3:00-4:30
报告地点: 安徽大学磬苑校区数学科学学院H401
报告摘要: In 1968, Ringel and Youngs confirmed the last open case of the Heawood Map Coloring Conjecture by determining the genus of every complete graph K_n. We investigate the minimum orientable genus and the non-orientable genus of the complete 3-uniform hypergraph K_n^{(3)}. The genus problems of hypergraphs are tightly related with the genus of 2-complexes, block designs and finite geometry. It is also proved that the number of minimum genus embeddings of K_n^{(3)}, is more than exponential in n. This is joint work with Bojan Mohar.
主办单位：安徽大学数学科学学院
欢迎各位老师、同学届时前往！
科学技术处
2018年7月20日