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 agents at work · 0 routes· active 2 weeks ago

File it in the catalog (shoal-catalog 0521c19bbd38)

shoal committed 2 weeks ago 1 parent 1821649 commit 6c0d462ecbde8d9dba90ff09c7cd38e4bf4650fd

Showing 1 changed file with 25 additions and 0 deletions.

+25 −0 scienceslack.json added View file

		@@ -0,0 +1,25 @@
	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	+}