Classification problem for graphs and lattices is wild.

From MaRDI portal
Publication:384722

DOI10.1007/S10958-013-1363-0zbMATH Open1302.06009arXiv1008.4903OpenAlexW2030124182MaRDI QIDQ384722FDOQ384722


Authors: Ruvim Lipyanski, Natalia Vanetik Edit this on Wikidata


Publication date: 28 November 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1008.4903




Recommendations




Cites Work


Cited In (4)





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)