ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S\mathcal{S} be a set of taxon sets, and let a grove be a collection of taxon sets with the potential to construct informative supertrees. A grove is maximal in S\mathcal{S} if it is not properly contained in another grove in S\mathcal{S}. The following properties are equivalent: Ané–Eulenstein conjecture.

  1. For any set S\mathcal{S} of taxon sets, the set of maximal groves in S\mathcal{S} is a partition of S\mathcal{S}.
  2. If two groves intersect, their union is a grove.
  3. Two maximal groves do not intersect.

The conjecture concerns when overlap among taxon sets guarantees that collections of phylogenies can be combined informatively; the source attributes it to Ané et al. and presents it as a criterion relevant to identifying useful groves in databases. The paper later notes that the analogous property fails for informative groves in general.

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.