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


On the Choice Number of Packings
Authors:G. R. Omidi  M. Shahsiah
Affiliation:1. Department of Mathematical Sciences, Isfahan University of Technology, , Isfahan, 84156-83111 Iran;2. School of Mathematics, Institute for Research in Fundamental Sciences (IPM), , P.O. Box 19395-5746 Tehran, Iran
Abstract:
In this note, we show that for positive integers s and k, there is a function urn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0001 such that every turn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0002 packing with at least urn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0003 edges, urn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0004, has choice number greater than s. Consequently, for integers s, k, t, and λ there is a urn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0005 such that every turn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0006 design with urn:x-wiley:10638539:jcd21299:equation:jcd21299-math-0007 has choice number greater than s. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 504‐507, 2012
Keywords:hypergraph  t‐design  choice number  packing AMS subject classification: 05C15, 05C65
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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