How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)

DOI10.1007/s00022-006-1889-0zbMath1122.51008OpenAlexW2074651286MaRDI QIDQ884682

Klaus Metsch

Publication date: 7 June 2007

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-006-1889-0

zbMATH Keywords

finite projective spaceblocking set

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20)

Related Items (6)

On \(q\)-analogues and stability theorems ⋮ Unnamed Item ⋮ On Zeros of a Polynomial in a Finite Grid ⋮ A case study in almost-perfect security for unconditionally secure communication ⋮ Proof of a conjecture of Metsch ⋮ The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces

This page was built for publication: How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)