The maximum number of lines contained in subsets of \(PG(k,2)\). (Q2715975)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum number of lines contained in subsets of \(PG(k,2)\). |
scientific article; zbMATH DE number 1600947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum number of lines contained in subsets of \(PG(k,2)\). |
scientific article; zbMATH DE number 1600947 |
Statements
20 July 2005
0 references
projective geometry
0 references
point
0 references
line
0 references
The maximum number of lines contained in subsets of \(PG(k,2)\). (English)
0 references
Let \(M\) be a set of \(m\) points of the projective geometry \(PG(k,2)\), \(m = 2^r + q\), \(0 \leq q < 2^r\). Then \(M\) contains at most \((2^r -1)(2^r -2)/6 + \binom {q+1}2\) lines. This estimate is the best possible.
0 references
0.7658601999282837
0 references
0.7613216042518616
0 references
