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


On a problem of Katona on minimal separating systems
Authors:Andrew Chi-Chih Yao
Institution:Department of Computer Science, University of Illinois, Urbana, IL 61801, U.S.A.
Abstract:Let S be an n-element set. In this paper, we determine the smallest number f(n) for which there exists a family of subsets of S{A1,A2,…,Af(n)} with the following property: Given any two elements x, yS (xy), there exist k, l such that AkAl= ?, and xAk, yAl. In particular it is shown that f(n)= 3 log3n when n is a power of 3.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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