The target-free clique conjecture for combinatorial threshold-linear networks
Statement
Let be a directed graph on nodes, and let be the associated combinatorial threshold-linear network (CTLN). A subset is a clique if has all bidirectional edges between distinct vertices. A vertex is a target of if every has in , and is target-free if it has no external target. Assume
The target-free clique conjecture. A subset is the support of a stable fixed point if and only if is a target-free clique. Target-free cliques are known to support stable fixed points, and the converse has been proved in several special cases, including oriented and symmetric graphs, networks with at most four nodes, and certain parameter ranges; the general statement remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.