题目：Forcing numbers and anti-forcing numbers of perfect matchings of graphs
报告人：Yeongnan Yeh (叶永南) 研究员   台北中央研究院数学所
报告时间：2014年6月9日（星期一）下午16:00
报告地点： 精正搂二楼学术报告厅
欢迎师生踊跃参加！
 
报告摘要:
For a perfect matching M of a graph G, a forcing set S of M is a subset of M contained in no other perfect matchings of G. The forcing number of the perfect matching M is the cardinality of a forcing set of M with the smallest size. A set S of edges of G is called an anti-forcing set of M if G-S has a unique perfect matching M. The anti-forcing number of M is the smallest cardinality of anti-forcing sets of M. In this talk, we introduce necessary conditions and sufficient conditions for forcing sets and anti-forcing sets, and with which calculate forcing numbers and anti-forcing numbers for some extremal graphs.