ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let two groves be strictly informative if each satisfies the strict informativeness criterion for determining supertrees. Let the groves be collections of taxon sets, with intersection and union taken as collections of taxon sets. Strictly informative grove union conjecture. The union of two intersecting strictly informative groves is a grove.

This is proposed as a weaker statement related to the earlier conjecture on groves. The paper gives a counterexample showing that the union of two intersecting strictly informative groves need not itself be strictly informative, even when it is a grove; the conjecture asserts only the weaker grove property.

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.