There is no McLaughlin geometry

DOI10.1016/J.JCTA.2017.10.004MaRDI QIDQ1689033zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård, Leonard H. Soicher

Publication date 12 January 2018

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.03372

zbMATH Keywords

partial geometrypseudogeometric graphMcLaughlin graphbacktrack searchKrein boundMcLaughlin geometry

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Association schemes, strongly regular graphs (05E30) Generalized quadrangles and generalized polygons in finite geometry (51E12)

Abstract: We determine that there is no partial geometry $calG$ with parameters $(s,t,alpha)=(4,27,2)$. The existence of such a geometry has been a challenging open problem of interest to researchers for almost 40 years. The particular interest in $calG$ 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.

Recommendations

• Is there a McLaughlin geometry?
• A characterization of the Petersen-type geometry of the McLaughlin group
• scientific article; zbMATH DE number 1249642
• On pseudogeometric graphs of the partial geometries $ pG_2(4,t)$
• There is no (75,32,10,16) strongly regular graph

Cites work

• scientific article; zbMATH DE number 3878945 (Why is no real title available?)
• scientific article; zbMATH DE number 3724472 (Why is no real title available?)
• scientific article; zbMATH DE number 1066165 (Why is no real title available?)
• scientific article; zbMATH DE number 749961 (Why is no real title available?)
• scientific article; zbMATH DE number 3326519 (Why is no real title available?)
• Classification algorithms for codes and designs
• Enumerating set orbits.
• Finding the smallest image of a set
• How reliable is a computer-based proof?
• Is there a McLaughlin geometry?
• Practical graph isomorphism. II.
• Strongly regular graphs having strongly regular subconstituents
• Strongly regular graphs, partial geometries and partially balanced designs
• The CRC handbook of combinatorial designs
• The Gewirtz graph: An exercise in the theory of graph spectra
• The nonexistence of a \((K_6-e)\)-decomposition of the complete graph \(K_{29}\)
• The regular two-graph on 276 vertices
• There are exactly five biplanes with k = 11

Cited in

(4)

• Enumerating Steiner triple systems
• Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry
• Nonexistence of certain pseudogeometric graphs
• Is there a McLaughlin geometry?

Describes a project that uses

Uses Software

• libexact
• Traces
• GRAPE
• Cliquer
• nauty
• GAP

This page was built for publication: There is no McLaughlin geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689033)