Classification problem for graphs and lattices is wild.

From MaRDI portal




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.









This page was built for publication: Classification problem for graphs and lattices is wild.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384722)