… plane 1t a blocking set is a set S of points … blocking sets in PG(2, q). Theorem 1.7 and
Corollary 1.8 give new bounds on the cardinality of a reduced (and so, of an arbitrary) blocking set …

… From the above it is clear that a blocking set cannot be derived from an n + 2-arc. By Theorem
3.9 in [5], a blocking set in π must contain at … This proves (ii). It is pointed out in [5] that no …

… k, n)-arc in a finite projective plane IIq of order q is a set of k points with some n but non+l
collinear points where k > n and 2 < n < q. The maximum value ofk for which a (k,n)-arc exists in …

… A set R of k points of n is called a k-arc if no three of its points are collinear. R is said to
be complete if it is not contained in any ii-arc for … between blocking sets and complete k-arcs. …

… The main objects of this paper are (k; n )-arcs and blocking sets. To put the … minimal blocking
set achieving the lower bound (i), while a Hermitian arc (unital) achieves the upper bound (ii…

… concentrate on arcs in … A blocking set is a subset S of the points of π such that each line in
π contains at least one point in S and at least one point not in S. We define a dual blocking set …

… In this thesis, a t-fold blocking set B in PG(2,q) is a set of points such that each line contains
… Chapter 2: Blocking Sets This chapter provides some basic equations about blocking sets, …

… Recall that a bZocking set in n is a subset S of the points of II satisfying the following two …
the blocking set W of Theorem 2.2 starting from the “non-Desarguesian” complete 6-arc K (a1 in […

… k-arcs in a projective plane of order q for all k < 8 and also by finding a formula for the number
of blocking sets. A … for the number of ?-arcs in such a plane. Ic? 1988 Academic Press, Inc. …

… and study blocking quadruples in graphs. We show that a circular-arc graph cannot have a
blocking quadruple, … (ii) G contains an induced subgraph isomorphic to a graph in Figure 1. …