MathDB1 problem
- 0 votes0 replies0 views
Finite termination of splitting processes for accessible quasi-transitive graphs
Finite termination conjecture. Every process of splittings must end after finitely many steps.
Finite termination of splitting processes for accessible quasi-transitive graphs
Finite termination conjecture. Every process of splittings must end after finitely many steps.