关于举行墨尔本大学Muhammad Adib Surani博士学术报告会的通知

报告题目：The Isoperimetric Problem in Block Designs
报 告 人：Dr. Muhammad Adib Surani（墨尔本大学）
报告时间：2016年7月18日（星期一）上午09:30-10:15
报告地点：4号楼4318室

欢迎广大师生前往！

                                                                       数学学院
                                                                   2016年07月15日
报告摘要：
  An independent set of a bipartite graph is called balanced if it contains exactly half its elements in each partite set. The problem of finding large balanced independent sets has applications in interconnection networks and coding theory, and we will use them in this talk to construct upper and lower bounds for the vertex-isoperimetric number of a graph, which is a measure of how "well-connected" the graph is. In particular, we will closely investigate these results for the point-hyperplane incidence graph of PG(n, q) as well as incidence graphs of classical unitals.