There is No McLaughlin Geometry
Combinatorics
2016-07-13 v1
Abstract
We determine that there is no partial geometry with parameters . The existence of such a geometry has been a challenging open problem of interest to researchers for almost 40 years. The particular interest in is due to the fact that it would have the exceptional McLaughlin graph as its point graph. Our proof makes extensive use of symmetry and high-performance distributed computing, and details of our techniques and checks are provided. One outcome of our work is to show that a pseudogeometric strongly regular graph achieving equality in the Krein bound need not be the point graph of any partial geometry.
Cite
@article{arxiv.1607.03372,
title = {There is No McLaughlin Geometry},
author = {Patric R. J. Östergård and Leonard H. Soicher},
journal= {arXiv preprint arXiv:1607.03372},
year = {2016}
}
Comments
19 pages