Number of fixed points and disjoint cycles in monotone Boolean networks

Julio Aracena, Adrien Richard, Lilian Salinas

Given a digraph $G$, a lot of attention has been deserved on the maximum number $\varphi (G)$ of fixed points in a Boolean network $f:\{0,1{\}}^n\to \{0,1{\}}^n$ with $G$ as interaction graph.…