Small extended generalized quadrangles
type: Item
instance of: scholarly article
title: Small extended generalized quadrangles
zbMATH Open document ID: 0709.51008
DOI: 10.1016/S0195-6698(13)80023-6
author: P. H. Fisher
author: Peter J. Cameron
published in: European Journal of Combinatorics
publication date: 1990-01-01T00:00:00Z
review text: An extended generalized quadrangle (EGQ) is a connected point-block incidence structure \({\mathcal G}\) with the property that for any point P the points collinear with P (and different from P) and the blocks incident with P form a generalized quadrangle known as the (point) residue at P. In this paper all examples are finite, and all point residues of \({\mathcal G}\) have the same parameters (s,t). So \({\mathcal G}\) is referred to as an EGQ(s,t). The authors are concerned in general with EGQ(s,t) having a minimal number of points. The extreme case, where the points of \({\mathcal G}\) consist of any one of its points P together with all the points in the residue at P, is called a one-point extension. They were studied extensively by \textit{J. A. Thas}, Symp. Math. 28, 127-143 (1986; Zbl 0601.51018). So the present authors concentrate on EGQ's larger than one- point extensions, but which are still relatively small. Many examples are given. Existence and uniqueness results are discussed, and many of them are analogues of (or are equivalent to) similar results for small strongly regular graphs. Here is a sample theorem: Suppose that an EGQ(s,t), with s even, has the property that, if a point P is not on a block x, then some point of x is not adjacent to P. Then \(v\geq (s+2)(st+t+1).\) If equality holds, then \(t=1\) or \(t=2\). When \(t=1\), the point graph is the complement of a square lattice graph; when \(t=2\), it is the complement of a triangular graph.
Mathematics Subject Classification ID: 51E12
zbMATH DE Number: 4165875
zbMATH Keywords: point residues
zbMATH Keywords: extended generalized quadrangle
MaRDI profile type: Publication
cites work: A class of graphs containing the polar spaces
cites work: Characterization theorems for Zara graphs
cites work: Finite nets. II: Uniqueness and imbedding
cites work: The Nonexistence of Certain Finite Projective Planes
cites work: Extensions of polar spaces and the doubly transitive symplectic groups
cites work: Locally polar spaces and related rank 3 groups
cites work: The nonexistence of ovals in a projective plane of order 10
cites work: Q5605257
cites work: Q3344217
cites work: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
cites work: Q4121914
cites work: Q4065708
cites work: Ovoids and spreads of finite classical polar spaces
cites work: Graphes liés aux espaces polaires
description: scientific article; zbMATH DE number 4165875