The classification problem for graphs and lattices is wild
Combinatorics
2020-08-03 v3 Rings and Algebras
Abstract
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.
Cite
@article{arxiv.1008.4903,
title = {The classification problem for graphs and lattices is wild},
author = {Ruvim Lipyanski and Natalia Vanetik},
journal= {arXiv preprint arXiv:1008.4903},
year = {2020}
}
Comments
Published under a different name with some additions - this one is redundant