Containment and reduction for cherry-unresolved reticulated-cherry stack CPNs

About 8 years old · traced to

Let NN and N′N' be CPNs on the same leaf-set in the (,)(, ) class. Here, a cherry-picking sequence (CPS) of NN is a sequence used to reduce N′N', and N′N' is contained in NN according to the network-containment relation. Containment–reduction conjecture. There exist CPNs NN and N′N' on the same leaf-set in this class such that N′N' is contained in NN, but no CPS of NN reduces N′N'. The converse of the implication that a CPS reducing N′N' implies containment is known to fail for other reconstructible classes; the corresponding question for this class is stated as open in the source.

References

Primary source

Remie Janssen and Yukihiro Murakami, “On Cherry-picking and Network Containment”, arXiv:1812.08065 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.