Pages that link to "Item:Q884682"
From MaRDI portal
The following pages link to How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\) (Q884682):
Displaying 12 items.
- Lines in higgledy-piggledy arrangement (Q405273) (← links)
- On \(q\)-analogues and stability theorems (Q408961) (← links)
- A case study in almost-perfect security for unconditionally secure communication (Q517272) (← links)
- Proof of a conjecture of Metsch (Q549254) (← links)
- Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\) (Q1385981) (← links)
- On the number of flats spanned by a set of points in \(PG(d,q)\) (Q1916131) (← links)
- The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces (Q2039997) (← links)
- Subspaces intersecting in at most a point (Q2302159) (← links)
- The maximum number of lines contained in subsets of \(PG(k,2)\). (Q2715975) (← links)
- On Zeros of a Polynomial in a Finite Grid (Q4635504) (← links)
- Blocking subspaces with points and hyperplanes (Q5883641) (← links)
- Maximal cocliques and the chromatic number of the Kneser graph on chambers of \(\mathrm{PG}(3, q)\) (Q6576930) (← links)
