The classification problem for graphs and lattices is wild

Details The classification problem for graphs and lattices is wild The classification problem for graphs and lattices is wild

2010-08-29

arxiv.org/abs/1008.4903v1

Mathematics

Combinatorics

6 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The classification problem for graphs and lattices is wild does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The classification problem for graphs and lattices is wild, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The classification problem for graphs and lattices is wild will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-312307