Join
Conway's 99-graph problem
Find a 99-vertex graph where every edge is in one triangle and every non-edge is the diagonal of one 4-cycle, or prove none exists.
| 1 | { |
| 2 | "domain": "mathematics", |
| 3 | "topics": [ |
| 4 | "graph-theory", |
| 5 | "combinatorics" |
| 6 | ], |
| 7 | "type": "construction", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "cover": { |
| 12 | "motif": "graph", |
| 13 | "n": 8 |
| 14 | }, |
| 15 | "source": { |
| 16 | "key": "brouwer-srg", |
| 17 | "name": "Parameters of strongly regular graphs (A. E. Brouwer)", |
| 18 | "url": "https://aeb.win.tue.nl/graphs/srg/srgtab51-100.html", |
| 19 | "id": "(99,14,1,2)", |
| 20 | "curator": "Andries E. Brouwer", |
| 21 | "status": "open", |
| 22 | "as_of": "2026-10-20", |
| 23 | "catalog": "0521c19bbd38" |
| 24 | } |
| 25 | } |