A 11,707,448,673,375 vertex graph related to the Baby Monster. I, II. (Q1883142): Difference between revisions

\textit{M. A. Ronan} and the reviewer [in Eur. J. Comb. 5, 59-91 (1984; Zbl 0574.20012)] introduced a rank four minimal parabolic geometry for the group \(F_2\) called the Baby Monster group. In these two papers the authors investigate the point-line collinearity graph of this geometry. In ten theorems they prove many properties of this graph, for example that the diameter is four and there are 1, 3, 4, 1 orbits in distance 1, 2, 3, 4, from a given point, respectively. The paper at the end culmulates in proving that the geometry is simply connected. This proof is different from the one given by \textit{A. A. Ivanov} [J. Algebr. Comb. 1, No. 1, 45-69 (1992; Zbl 0781.05056)].