A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems

Details A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems

2011-09-18

arxiv.org/abs/1109.3847v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560507