ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a pure graph GG (or its parity class [G][G]) be primitive when, for every family F\mathcal{F} of pure classes, [G]∈F‾[G]\in\overline{\mathcal{F}} implies [G]∈F[G]\in\mathcal{F}. A pure graph is prime when it has no non-trivial decomposition of the type considered in the paper. The primitive pure graph conjecture. All primitive pure graphs are prime. This is stated as a conjecture about the relationship between the closure-based notion of primitivity and graph primeness; the supplied text gives no resolution status.

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.