A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems
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 ≤ (2v+5 - 24v+25)/2. We also show that equality can be attained in this bound for infinitely many values of v.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.