2 problems

The target-free clique conjecture. A subset $\sigma$ is the support of a stable fixed point if and only if $\sigma$ is a target-free clique. Target-free cliques are known to suppor…

Composite-graph permitted motif conjecture. $G$ is a permitted motif if and only if every component $G_i$ is permitted.