There is no McLaughlin geometry

DOI10.1016/j.jcta.2017.10.004zbMath1377.05043arXiv1607.03372OpenAlexW2963502174MaRDI QIDQ1689033

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

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

backtrack searchpartial geometrypseudogeometric graphMcLaughlin graphKrein boundMcLaughlin geometry

Mathematics Subject Classification ID

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

Related Items

Enumerating Steiner triple systems ⋮ Nonexistence of certain pseudogeometric graphs ⋮ Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification algorithms for codes and designs
• How reliable is a computer-based proof?
• Strongly regular graphs having strongly regular subconstituents
• The regular two-graph on 276 vertices
• The Gewirtz graph: An exercise in the theory of graph spectra
• Practical graph isomorphism. II.
• Is there a McLaughlin geometry?
• Strongly regular graphs, partial geometries and partially balanced designs
• The nonexistence of a (K₆-e)-decomposition of the complete graphK₂₉
• Finding the smallest image of a set
• There are exactly five biplanes with k = 11