The classification problem for graphs and lattices is wild
Ruvim Lipyanski, Natalia Vanetik · arXiv (Cornell University) · 2010
We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification problem for pairs of matrices up to simultaneous similarity.