Extended generalized hexagons
Published online by Cambridge University Press: 24 October 2008
Extract
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.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 108 , Issue 1 , July 1990 , pp. 7 - 19
- Copyright
- Copyright © Cambridge Philosophical Society 1990
References
REFERENCES
- 3
- Cited by