Английская Википедия:Games graph
Шаблон:Distinguish In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1,20). This means that it has 729 vertices, and 40824 edges (112 per vertex). Each edge is in a unique triangle (it is a locally linear graph) and each non-adjacent pair of vertices have exactly 20 shared neighbors. It is named after Richard A. Games, who suggested its construction in an unpublished communicationШаблон:R and wrote about related constructions.Шаблон:R
Construction
The construction of this graph involves the 56-point cap set in <math>PG(5,3)</math>. This is a subset of points with no three in line in the five-dimensional projective geometry over a three-element field, and is unique up to symmetry.Шаблон:R The six-dimensional projective geometry, <math>PG(6,3)</math>, can be partitioned into a six-dimensional affine space <math>AG(6,3)</math> and a copy of <math>PG(5,3)</math>, which forms the set of points at infinity with respect to the affine space. The Games graph has as its vertices the 729 points of the affine space <math>AG(6,3)</math>. Each line in the affine space goes through three of these points, and through a fourth point at infinity. The graph contains a triangle for every line of three affine points that passes through a point of the cap set.Шаблон:R
Properties
Several of the graph's properties follow immediately from this construction. It has <math>729=3^6</math> vertices, because the number of points in an affine space is the size of the base field to the power of the dimension. For each affine point, there are 56 lines through cap set points, 56 triangles containing the corresponding vertex, and <math>112=56\times 2</math> neighbors of the vertex. And there can be no triangles other than the ones coming from the construction, because any other triangle would have to come from three different lines meeting in a common plane of <math>PG(6,3)</math>, and the three cap set points of the three lines would all lie on the intersection of this plane with <math>PG(5,3)</math>, which is a line. But this would violate the defining property of a cap set that it has no three points on a line, so no such extra triangle can exist. The remaining property of strongly regular graphs, that all non-adjacent pairs of points have the same number of shared neighbors, depends on the specific properties of the 5-dimensional cap set.
Related graphs
With the <math>3\times 3</math> Rook's graph and the Brouwer–Haemers graph, the Games graph is one of only three possible strongly regular graphs whose parameters have the form <math>\bigl((n^2+3n-1)^2,n^2(n+3),1,n(n+1)\bigr)</math>.Шаблон:R
The same properties that produce a strongly regular graph from a cap set can also be used with an 11-point cap set in <math>PG(4,3)</math>, producing a smaller strongly regular graph with parameters (243,22,1,2).Шаблон:R This graph is the Berlekamp–Van Lint–Seidel graph.Шаблон:R
References
