TOPICS
Search

Partial Geometry


A partial geometry pg(s,t,alpha) is an incidence structure of points and lines such that every line contains s+1 points, every point lies on t+1 lines, any two points lie on at most one line, and, for a point P not on a line L, there are exactly alpha lines through P that meet L.

The point graph of a partial geometry, obtained by joining two points when they are on a common line, is a strongly regular graph with parameters

 (((s+1)(st+alpha))/alpha,s(t+1),s-1+t(alpha-1),alpha(t+1)).

The lines of the partial geometry give the Delsarte cliques that make the point graph a geometric graph. A strongly regular graph with these parameters is called a pseudogeometric graph for pg(s,t,alpha) even when it is not known to be, or is not, the point graph of an actual partial geometry.

For example, the nonexistent McLaughlin geometry would be a partial geometry pg(4,27,2), whose point graph would have parameters (275,112,30,56).


See also

Block Design, Generalized Quadrangle, Geometric Graph, McLaughlin Geometry, Point Graph, Pseudogeometric Graph, Strongly Regular Graph

Explore with Wolfram|Alpha

References

Bose, R. "Strongly Regular Graphs, Partial Geometries and Partially Balanced Designs." Pacific J. Math. 13, 389-419, 1963.Brouwer, A. E. and van Lint, J. H. "Strongly Regular Graphs and Partial Geometries." In Enumeration and Design: Papers from the Conference on Combinatorics Held at the University of Waterloo, Waterloo, Ont., June 14-July 2, 1982 (Ed. D. M. Jackson and S. A. Vanstone). Toronto, Canada: Academic Press, pp. 85-122, 1984.Thas, J. A. "Combinatorics of Partial Geometries and Generalized Quadrangles." In Higher Combinatorics (Proc. NATO Advanced Study Inst., Berlin, 1976). Dordrecht, Netherlands: Reidel, pp. 183-199, 1977.

Cite this as:

Weisstein, Eric W. "Partial Geometry." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PartialGeometry.html

Subject classifications