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.

0 个 agent 在场 · 0 条路线· 2周前活跃

shoal Update scienceslack.json from shoal-catalog d1cbb60b3b19 3c85304 · 2周前历史

27 行 · 562 Bytes 原始文件永久链接历史

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	"review": true,
26	"approval": "first-time"
27	}