Blocking subspaces with points and hyperplanes

Abstract

In this paper, we characterise the smallest sets B consisting of points and hyperplanes in PG(n, q), such that each k-space is incident with at least one element of B. If k>n−1, then the smallest construction consists 2 only of points. Dually, if k

Publication Title

Australasian Journal of Combinatorics

This document is currently not available here.

Share

COinS