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.
|Number of pages||5|
|Journal||Journal of Mathematical Sciences|
|State||Published - 1 Jun 2013|
ASJC Scopus subject areas
- Statistics and Probability
- Mathematics (all)
- Applied Mathematics