We review fundamental results in the so-called structure theory of set addition as well as
their applications to other fields. 1.'Structure theory of set addition'^ 1) is a shorthand for a …

A family of mutually intersecting k-sets is called a k-clique. A k-clique is maximal if it is not
contained in any larger k-clique. Using a classification result of Wettl we give a new upper …

On the nuclei of a pointset of a finite projective plane Page 1 Journal of Geometry Vol.30 (1987)
0047-2468/87/020157-0751.50+0.20/0 (c) 1987 Birkh~user Verlag, Basel ON THE NUCLEI …

In a previous paper 1, all point sets of minimum size in PG (2, q), blocking all external lines
to a given irreducible conic \calC, have been determined for every odd q. Here we obtain a …

A trivial upper bound on the size k of an arc in an r-net is $ k\leq r+ 1$. It has been known for
about 20 years that if the r-net is Desarguesian and has odd order, then the case $ k= r+ 1 …

Note Sets with a Large Number of Nuclei on a Conic Page 1 JOURNAL OF COMBINATORIAL
THEORY, Series A 63, 164-173 (1993) Note Sets with a Large Number of Nuclei on a Conic A …

Segre-type theorems in finite geometry Page 1 Rendiconti di Matematica, Serie VII Volume 26,
Roma (2006), 95-120 Segre-type theorems in finite geometry GÁBOR KORCHMÁROS …

A blocking set in a projective plane is a point set intersecting each line. The smallest
blocking sets are lines. The second smallest minimal blocking sets are Baer subplanes …

Remark. If G= Z/pZ, p being a prime, then K+ K= G or 21K [--1. This follows from the theorem
of Kneser or from Cauehy-Davenport's theorem (see Mann [2, p. 3]). Let G be any other …

In a previous paper [1], all point sets of minimum size in PG (2; q), blocking all external lines
to a given irreducible conic CC, have been determined for every odd q. Here we obtain a …