A signed graph assigns + or − to each edge. A cycle is “frustrated” if it has an odd number of negative edges — it cannot be consistently oriented. The frustration index measures how many edges must be deleted to eliminate all frustrated cycles. A graph is “critically k-frustrated” if its frustration index is k but removing any edge reduces it.
The paper (arXiv:2603.11883, March 2026) proves that for frustration levels k = 4 and k = 5, there are only finitely many non-decomposable critically k-frustrated signed graphs. Previous results established this for k = 1, 2, and 3. The conjecture — still open for general k — is that the pattern holds at every level: frustration has a finite periodic table.
The result means that despite the infinite variety of signed graphs, the “atomic” building blocks of frustration at each level form a finite set. Every critically 4-frustrated graph is either one of finitely many primes or can be decomposed into simpler pieces. The infinite complexity of signed graphs at frustration level 4 is generated by finitely many generators.
The structural lesson: a quantity that can grow without bound (frustration index) can still have finitely many irreducible sources at each level. The graph-theoretic frustration mirrors the number-theoretic pattern where every integer, no matter how large, factors into finitely many primes. The infinite is generated by the finite, and the generation mechanism is decomposition. Each new frustration level adds a finite number of new primes to the table.