arXiv Analytics

Sign in

arXiv:0809.2282 [math.CO]AbstractReferencesReviewsResources

New lower bounds for the number of blocks in balanced incomplete block designs

Muhammad Ali Khan

Published 2008-09-12, updated 2015-05-31Version 2

Bose proved the inequality $b\geq v+r-1$ for resolvable balanced incomplete block designs (RBIBDs) and Kageyama improved it for RBIBDs which are not affine resolvable. In this note we prove a new lower bound on the number of blocks $b$ that holds for all BIBDs. We further prove that for a significantly large number of BIBDs our bound is tighter than the bounds given by the inequalities of Bose and Kageyama.

Related articles: Most relevant | Search more
arXiv:1207.3319 [math.CO] (Published 2012-07-13)
Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
arXiv:math/0312149 [math.CO] (Published 2003-12-07)
An inequality for regular near polygons
arXiv:math/0310142 [math.CO] (Published 2003-10-10)
Lower bounds for simplicial covers and triangulations of cubes