Cover Free Families
报告题目: Cover Free Families
报告人：Ruizhong Wei教授，加拿大Lakehead 大学
报告时间：2015年12月25日（周五）上午10：00
地点：维格堂319
报告摘要：Cover free families are well-known combinatorial objects that have a lot of applications in computer science and other disciplines. In this talk, we will revisit some combinatorial techniques used on research of such objects. The concepts and methods for these methods are different from that for classical combinatorial designs. We will discuss some bounds of CFFs and constructions of CFFs. Some new results and problems will be discussed too