首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Sur le nombre transversal des hypergraphes uniformes
Authors:François Sterboul
Institution:Eudil-Université de Lille 1, Lille, France
Abstract:The transversal number of a given hypergraph is the cardinality of the smallest set of vertices meeting all the edges. What is the maximal possible value of the transversal number of a r-uniform hypergraph on n vertices with maximal degree p? The problem is solved here for p = 2, by using Berge's theorem on matchings.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号