There exist caps which block all spaces of fixed codimension in \(\mathbb{P}\mathbb{G} (n,2)\) (Q1906127): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There exist caps which block all spaces of fixed codimension in \(\mathbb{P}\mathbb{G} (n,2)\) |
scientific article |
Statements
There exist caps which block all spaces of fixed codimension in \(\mathbb{P}\mathbb{G} (n,2)\) (English)
0 references
26 February 1996
0 references
In this 2-page note, the 3 authors prove that for any \(k \geq 0\), and for every \(n\) such that there exists a triangle free graph with \(n + 1\) vertices and of chromatic number larger than \(2^k\), there exists a cap in \(PG(n,2)\) which intersects all subspaces of dimension \(n - k\) of \(PG(n,2)\).
0 references
caps
0 references
chromatic number
0 references
binary linear codes
0 references
