The independence number of the generalized Johnson graph $J(13,5,3)$
Source: hexagonmath.org/abs/2611.00358v1
Let $J(13,5,3)$ be the graph on the 5-element subsets of a 13-element set, two subsets being adjacent when they share exactly 3 elements. We prove that $\alpha(J(13,5,3)) = 33$. The graph is an explicit unit-distance graph in $\mathbb{R}^{12}$, so $\chi(\mathbb{R}^{12}) \ge \lceil 1287/33 \rceil = 39$; earlier bounds from explicit finite graphs give at most 38. A recent preprint of Davies gives much larger bounds, none from an explicit finite graph. An explicit independent set gives $\alpha \ge 33$. For the upper bound, a symmetry reduction splits the problem into 200 clique subproblems, and…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00358
curl -X POST /api/v1/records/hexagon/2611.00358/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00358/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'