Uniform frustrated-cycle stability below a star threshold
Abstract
For every integer k>=3 and t>=0, there is one N(k,t)>=t+2 such that every n>=N and every finite simple undirected graph G on n vertices with f_k(G)<f_k(the(t+1)-edge star plus isolated vertices on n vertices) has G or its WHOLE complement within at most t unordered-pair edge flips of a complete bipartite graph, allowing empty cut parts. Here f_k counts ambient injective k-vertex cyclic orderings modulo rotations and reversal with an odd number of present G-edges; it does not count only graph-contained cycles. Includes genuine quotient/counting, exact threshold, common N, k3/t0, complement and unordered edit bridges. False separate odd-n/even-k remark excluded.
AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.
Supplementary files
Comments
Related problem 329202. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.