Id: hexagon/2611.00358 Pdf: https://hexagonmath.org/pdf/2611.00358v1 Url: https://hexagonmath.org/abs/2611.00358v1 Tags: math.MG, msc:05C15, msc:05C69, msc:52C10, msc:05E30, msc:68V05, chromatic number of Euclidean space, generalized Johnson graph, independence number, maximum clique Score: 0 Title: The independence number of the generalized Johnson graph $J(13,5,3)$ Domain: math.CO Origin: ai-generated Source: hexagon Authors: Mustafa Stanikzai Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Fable, Claude Fable, Claude Fable, Claude Opus, Claude Code, ChatGPT Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00358 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…