ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a composite graph with skeleton G^\widehat G. A permitted motif is a motif that supports a fixed point of the associated competitive threshold-linear network. Assume that G^\widehat G is a permitted motif.

Composite-graph permitted motif conjecture. GG is a permitted motif if and only if every component GiG_i 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.