题 目 ：Some conjecturesabout bisection of graphs

报告人：颜娟 博士， 新疆大学

报告时间：2016年1月22号下午 4:30-5:30

地点：1418

摘要：

A bisection of a graph is abalanced bipartite spanning subgraph. Bollobas and Scott conjectured thatevery graph G has a bisectionsuch that for each  . In this talk wewill see that for certain complete multipartite graphs the conjecturedbound is not true. However,  in all those graphs the actual bound onthe size of a bisection is for each .  Hartke and Seacrest conjecturedthat every graphic sequence has a realization for which the Bollobas-Scottconjecture holds. We will discuss these two conjectures.