题目: Menger's Paths with Minimum Mergings
报告人: Prof. Guangyue Han
Department of Mathematics
University of Hong Kong, Hong Kong
时间： 6月27日 下午 3:30
地点： 浙江大学 控制系工控新楼501
Abstract: For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number of mergings between these paths is upper bounded by a constant depending only on the min-cuts between the sources and the sinks, regardless of the size and topology of the graph. We also give bounds on the minimum number of mergings between these paths, and discuss how it depends on the min-cuts.
Bio: Guangyue Han received the B.S. and M.S. degree in mathematics from Peking University, China, and the Ph.D. degree in mathematics from University of Notre Dame, U.S.A. in 1997, 2000 and 2004, respectively. After three years with the department of mathematics at University of British Columbia, Canada, he joined the department of mathematics at University of Hong Kong, China in 2007. His main research areas are analysis and combinatorics, with an emphasis on their applications to coding and information theory.