Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T08:01:10.424Z Has data issue: false hasContentIssue false

Extended generalized hexagons

Published online by Cambridge University Press:  24 October 2008

Richard Weiss
Affiliation:
Department of Mathematics, Tufts University, Medford, MA 02155, U.S.A.
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.

As in [2], we define a geometry Γ = (B2, …, Br; *) to be an ordered sequence of r pairwise disjoint non-empty sets Bi together with a symmetric incidence relation * on their union B = B1 ∪ … ∪ Br such that if F is any maximal set of pairwise incident elements (i.e. a maximal flag), then |F ∩ Bi| = 1 for i = 1,…, r. The number r is called the rank of Γ. The geometry Γ is called connected if the r-partite graph (Γ, *) is connected.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1990