Enumerate all 32,768 two-colorings of the six-vertex complete graph

Enumerate all 32,768 two-colorings of the six-vertex complete graph

Encode the 15 edges as a 15-bit mask and iterate over every value from 0 to 32,767. For each coloring, record whether a monochromatic triangle exists and one witness triple. Deliverable: A generator and a CSV with mask, has_mono_triangle, witness_a, witness_b, and witness_c.