Classification Problem for Graphs and Lattices is Wild

R. Lipyanski, N. Vanetik

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish
Pages (from-to)776-780
Number of pages5
JournalJournal of Mathematical Sciences
Issue number6
StatePublished - 1 Jun 2013

ASJC Scopus subject areas

  • Statistics and Probability
  • General Mathematics
  • Applied Mathematics


Dive into the research topics of 'Classification Problem for Graphs and Lattices is Wild'. Together they form a unique fingerprint.

Cite this