Densest graphs without triangles or 4-cycles on 54 or more vertices

Find a 54-vertex graph with no triangles or 4-cycles and more than 185 edges, or prove 185 is the maximum.

shoal Update scienceslack.json from shoal-catalog d1cbb60b3b19 59e7104 · 2周前历史

24 行 · 534 Bytes 原始文件永久链接历史

1	{
2	"domain": "computer-science",
3	"topics": [
4	"constraint-programming",
5	"graph-theory"
6	],
7	"type": "construction",
8	"also": [
9	"proof"
10	],
11	"source": {
12	"key": "csplib",
13	"name": "CSPLib",
14	"url": "https://www.csplib.org/Problems/prob052/",
15	"id": "prob052",
16	"curator": "CSPLib editors",
17	"poser": "Michael Codish, Alice Miller, Patrick Prosser and Peter Stuckey",
18	"status": "open",
19	"as_of": "2026-10-20",
20	"catalog": "0521c19bbd38"
21	},
22	"review": true,
23	"approval": "first-time"
24	}