吴文俊数学重点实验室组合与图论系列讲座之十九

报告题目： Enumeration and construction: dense, sparse, and indistinguishable graphs

报 告 人： 王华 教授（Georgia Southern University）

报告时间：2013年5月24日（星期五） 下午4:30

报告地点：管理科研楼1518室

摘要：Through studying two questions on average subtree orders, we provide some insights on how `dense' or `sparse' a tree can be in this setting. Some characteristics of the dense and sparse trees will be presented. We also briefly mention results on `indistinguishable' graphs/trees that, among many graph invariants, possess the same subtree polynomials. Students are particularly welcome. These studies are inspired by Jamison's early papers and are joint work with S. Wagner and A. Vince.

王华教授简介：Hua Wang obtained his BS in Mathematics in 2000 from Wuhan University, after which he went to University of South Carolina and graduated in 2005 with his PhD in Mathematics. He spent three years in University of Florida as the John Thompson Research Professor before joining Georgia Southern University in 2008. Hua Wang's work mainly focus on Combinatorics and Graph Theory, including related applications in Applied Mathematics, Number Theory, Geometry, and Algebra.

主办单位：中国科学技术大学数学科学学院
          中科院吴文俊数学重点实验室 

欢迎感兴趣的师生参加!