信息服务
学术讲座
Ribbon graphs, partial dual and Eulerian partial duals
发文单位：数学与软件科学学院 发布时间：2018年06月20日 15 : 18 : 55
讲座时间：2018/6/22 16:30:00
讲座地点：数学与软件科学学院205室
主办单位：数学与软件科学学院
主讲人 ：金贤安 教授
主讲人简介：
金贤安，现任厦门大学教授、博导、副院长，中国运筹学会图论组合分会青年工作委员会副主任、中国工业与应用数学学会图论组合及其应用专业委员会理事。研究方向为图多项式、组合纽结理论和拓扑图论。主持三项国家自然科学基金，参与国家自然科学基金项目重点项目，在J. Graph Theory, Adv. in Appl. Math., Proc. Amer. Math. Soc., J. Stat. Phys.等重要期刊发表论文40余篇。
Abstract: In this talk, I shall first give several (equivalent) definitions of ribbon graphs and their partial duals, a generalization of geometrical dual of cellularly embedded graphs from the set of edge of the graph to all subsets of the set of edges of the graph. We then talk about a little background or history as far as I know. A ribbon graph with m edges has 2m (not necessarily distinct) partial duals. Huggett and Moffatt characterized bipartite partial duals of a plane graph (i.e. among all partial duals, which are bipartite?). They posed an open problem for characterizing Eulerian partial duals of a plane graph. We solve it and further generalize it from plane graphs to any ribbon graphs.
川公网安备 51010402000410号
