Finite termination of splitting processes for accessible quasi-transitive graphs
Finite termination conjecture. Every process of splittings must end after finitely many steps.