The primitive pure graph conjecture
Statement
Let a pure graph (or its parity class ) be primitive when, for every family of pure classes, implies . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.