A Problem Concerning Nonincident Points and Lines in Projective Planes
Combinatorics
2011-09-20 v2
Abstract
In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also show that equality can be attained in this bound whenever q is an even power of two.
Cite
@article{arxiv.1109.1573,
title = {A Problem Concerning Nonincident Points and Lines in Projective Planes},
author = {Douglas R. Stinson},
journal= {arXiv preprint arXiv:1109.1573},
year = {2011}
}