Pseudo-geometric graphs of the partial geometries pG 2 (4, t) (Q4522864)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1548670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudo-geometric graphs of the partial geometries pG 2 (4, t) |
scientific article; zbMATH DE number 1548670 |
Statements
Pseudo-geometric graphs of the partial geometries pG 2 (4, t) (English)
0 references
4 June 2001
0 references
strongly regular graph
0 references
pseudo-geometric
0 references
partial geometry
0 references
0 references
0 references
0.8040031
0 references
0.77827364
0 references
0 references
0 references
0.75324506
0 references
An incidence structure consisting of points and lines is called an \(\alpha\)-partial geometry of order \((s,t)\) if any line contains \(s+1\) points, any point lies on \(t+1\) lines, two lines meet in at most one point, and for any antiflag \((P,l)\) there exist exactly \(\alpha\) lines through \(P\) meeting the line \(l\). It is well known that the point graph of such a partial geometry is a strongly regular graph with parameters \(v=(s+1)(1+st/\alpha)\), \(k=s(t+1)\), \(\lambda = (s-1) + (\alpha -1)t\), and \(\mu = \alpha (t+1)\). Any strongly regular graph with these parameters is called pseudo-geometric. Any 3-coclique in a strongly regular graph with the property that the intersection of the neighborhoods of the three vertices is empty is called a ``bad triple''. The main result in this paper is to show that any pseudo-geometric strongly regular graph which contains a bad triple must be either the triangle graph \(T(6)\) or the graph \(\overline{J}(8,4)\) obtained from the Johnson graph \(J(8,4)\) by identifying 4-tuples with their complements. As a result of this work it is conjectured that every pseudo-geometric strongly regular graph must contain a 5-clique. The author proves this conjecture to be true if \(t\leq 3\). The proof of the main theorem relies on the characterization of locally \((4 \times 4)\)-grid graphs given in \textit{A. Blokhuis} and \textit{A. E. Brouwer} [Locally 4-by-4 grid graphs, J. Graph Theory 13, No. 2, 229--244 (1989; Zbl 0705.05057)].
0 references