Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-13T15:51:41.293Z Has data issue: false hasContentIssue false

Partial Spreads and Replaceable Nets

Published online by Cambridge University Press:  20 November 2018

A. Bruen*
Affiliation:
Colorado State University, Fort Collins, Colorado
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A blocking set S in a projective plane Π is a subset of the points of Π such that every line of Π contains at least one point of S and at least one point not in S. In previous papers [5; 6], we have shown that if Π is finite of order n, then n + √n + 1 ≦ |S| ≦ n 2 – √n (see [6, Theorem 3.9]), where |S| stands for the number of points of S. This work is concerned with some applications of the above result to nets and partial spreads, and with some examples of partial spreads which give rise to unimbeddable nets of small deficiency.

In the next section we re-prove a well known result of Bruck which states that if N is a replaceable net of order n and degree k then k ≧ √n + 1, and show how this bound can be improved if n = 7, 8, or 11.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1971