Skip to main content
Article thumbnail
Location of Repository

Nonincident Points and Blocks in Designs

By Douglas R. Stinson


In this paper, we study the problem of finding the largest possible set of s points and s blocks in a balanced incomplete block design, such that that none of the s points lie on any of the s blocks. We investigate this problem for two types of BIBDs: projective planes and Steiner triple systems. For a Steiner triple system on v points, we prove that s ≤ (2v + 5 − √ 24v + 25)/2 and we determine necessary and sufficient conditions for equality to be attained in this bound. For a projective plane of order q, we prove that s ≤ 1 + (q + 1) ( √ q − 1) and we also show that equality can be attained in this bound whenever q is an even power of two.

Year: 2012
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.