Classification Problem for Graphs and Lattices is Wild Academic Article uri icon

abstract

  • The classification problem for finite and infinite algebraic lattices has also been extensively addressed. A wild classification problem contains the classification problem of pairs of matrices up to simultaneous similarity. In this paper, we prove that the classification problem for graphs is wild by reducing the classification problem for finite 2-nilpotent p-groups to the classification problem for graphs.

publication date

  • January 1, 2013