Flip-Flop Sublinear Models for Graphs: Proof of Theorem 1

This addresses a theoretical gap in graph theory and computational complexity for researchers in those fields, but it is incremental as it builds on existing work without broad practical implications.

The paper tackled the problem of determining the existence of class-duals for sublinear models on graphs, and the result was a proof that no such class-dual exists for almost all of these models.