The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

For integers s,t≥2, the Ramsey number r(s,t) denotes the minimum n such that every n-
vertex graph contains a clique of order s or an independent set of order t. In this paper we …

Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

The projective and polar geometries that arise from a vector space over a finite field are
particularly useful in the construction of combinatorial objects, such as latin squares …

Apart from being an interesting and exciting area in combinatorics with beautiful results,
finite projective spaces or Galois geometries have many applications to coding theory …

A ϱ ϱ-saturating set of PG (N, q) PG (N, q) is a point set SS such that any point of PG (N, q)
PG (N, q) lies in a subspace of dimension at most ϱ ϱ spanned by points of S S. It is …

In this paper, we provide a complete classification of 2-(v, k, 2) designs admitting a flag-
transitive automorphism group of affine type with the only exception of the semilinear 1 …

Finite Geometries stands out from recent textbooks about the subject of finite geometries by
having a broader scope. The authors thoroughly explain how the subject of finite geometries …

In this paper, results of a non-exhaustive computer search for unitals in the known planes of
order twenty-five are reported. The 2-(126, 6, 1) designs associated with newly found unitals …