PreprintarXiv licencearXiv
A Spanning Subgraph of Conway's 99-graph
Abstract
We show that in any hypothetical G = srg(99,14,1,2) a spanning subgraph with $189$ edges is forced. Moreover, the graph formed out of the remaining edges has the spectrum (121,−430, 340,−26,07) expressed in Brouwer's notation.
Related
- Integer linear programming based methods for computing the maximum chordal subgraph of an arbitrary graph
- An Induced Subgraph Paradigm for Strongly Regular Graph Constructions
- Tests of graph homogeneity, subgraph counts, and quasirandomness
- On the sum of eccentric subgraph numbers of the vertices of a connected graph
- A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph
BibTeX
@misc{natal2026spanning,
title = {{A Spanning Subgraph of Conway's 99-graph}},
author = {Joseph Natal and Oleksiy Al-saadi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16266},
eprint = {2610.16266},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16266},
}
RIS
TY - UNPB
TI - A Spanning Subgraph of Conway's 99-graph
AU - Joseph Natal
AU - Oleksiy Al-saadi
PY - 2026
DA - 2026/10/24
PB - arXiv
DO - 10.48550/arxiv.2610.16266
UR - https://arxiv.org/abs/2610.16266
AB - We show that in any hypothetical G = srg(99,14,1,2) a spanning subgraph with $189$ edges is forced. Moreover, the graph formed out of the remaining edges has the spectrum (12^1,−4^30, 3^40,−2^6,0^7) expressed in Brouwer's notation.
ER -