The minimum independence number for designs |
| |
| Authors: | David A Grable Kevin T Phelps Vojtěch Rödl |
| |
| Institution: | (1) Department of Algebra, Combinatorics, and Analysis, Auburn University, 36849-5307 Auburn, AL, USA;(2) Present address: Department of Mathematical Sciences, Clemson University, 29634-1907 Clemson, SC, USA;(3) Department of Algebra, Combinatorics, and Analysis, Auburn University, 36849-5307 Auburn, AL, USA;(4) Department of Mathematics and Computer Science, Emory University, 30322 Atlanta, GA, USA |
| |
| Abstract: | Fort=2,3 andk 2t–1 we prove the existence oft–(n,k, ) designs with independence numberC
,k
n
(k–t)/(k–1)
(ln n)
1/(k–1)
. This is, up to the constant factor, the best possible.Some other related results are considered.Supported by NSF Grant DMS-9011850 |
| |
| Keywords: | 05 B 05 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
