The composite-graph permitted motif conjecture
Statement
Let be a composite graph with skeleton . A permitted motif is a motif that supports a fixed point of the associated competitive threshold-linear network. Assume that is a permitted motif.
Composite-graph permitted motif conjecture. is a permitted motif if and only if every component is permitted.
This conjecture asks whether the characterization proved for disjoint, clique, and cyclic unions extends to all composite graphs whose skeletons are permitted motifs. The supplied text gives no resolution, so its status 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.