Combinatorial curvature for planar graphs
主 题: Combinatorial curvature for planar graphs
报告人: 华波波 (复旦大学)
时 间: 2017-04-19 16:00-17:00
地 点: 理科1号楼1479
Abstract: The combinatorial curvature of a planar graph is defined as the generalized Gaussian curvature of its polygonal surface with a piecewise flat metric. We will show that the total curvature of a planar graph with nonnegative combinatorial curvature is an integral multiple of 1/12, up to a normalization of 2\pi. If time permits, we may discuss some problems related to the corner curvature of a planar graph, proposed by Baues and Peyerimhoff.
This is a joint work with Yanhui Su.
