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.
Recommendations
- scientific article; zbMATH DE number 1491624
- scientific article; zbMATH DE number 3815
- scientific article; zbMATH DE number 247192
- scientific article; zbMATH DE number 3885922
- Boundary classes of graphs for some recognition problems
- Solving problems on special classes of graphs
- The geodesic classification problem on graphs
- scientific article; zbMATH DE number 2091962
- The Classification of Finitely Spreading Graphs
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)