A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems
Combinatorics
2011-09-20 v1
Abstract
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 \leq (2v+5 - \sqrt{24v+25})/2. We also show that equality can be attained in this bound for infinitely many values of v.
Cite
@article{arxiv.1109.3847,
title = {A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems},
author = {Douglas R. Stinson},
journal= {arXiv preprint arXiv:1109.3847},
year = {2011}
}