{"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","summary":"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…","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","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}