1 problem

Matching

Finite termination of splitting processes for accessible quasi-transitive graphs
About 8 years old
Finite termination conjecture. Every process of splittings must end after finitely many steps.
opengraph-theory group-accessibility quasi-transitive-graphs
09