2011/09/18 by Stinson, Douglas R.
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1109.3847
In this paper, we study the problem of finding the largest possible set of s points and s blocks in a Steiner triple system of order v, such that that none of the s points lie on any of the s blocks. We prove that s ≤ (2v+5 - √(24v+25))/2. We also show that equality can be attained in this bound for infinitely many values of v.