Maximal cocliques of a strongly regular graph with parameters (2048,276,44,36)

TL;DR

This paper investigates the maximal cocliques in a specific strongly regular graph related to the extended binary Golay code, providing data and tools to analyze its independence sets.

Contribution

It provides a detailed enumeration of maximal independence sets in the graph and offers computational tools for further analysis.

Findings

Maximal independence sets range from size 20 to 67 and include size 72.

A data file encodes all these maximal independence sets.

Tools are provided to verify and generate adjacency and independence set data.

Abstract

This article considers a strongly regular graph with parameters (2048,276,44,36) that is related to the extended binary Golay code. That graph is known since about 1975 but there seems to be not much information on the contained maximal cocliques. The source package of this article contains a data file that encodes a sequence of maximal independence sets of that graph, covering all sizes from 20 to 67 and the size 72, and a Pascal program to check this assertion and to optionally generate a text file (to be read by the computer algebra system GAP) that contains the adjacency lists of that graph and the list of the independence sets.