Classification problem for graphs and lattices is wild.

DOI10.1007/S10958-013-1363-0zbMath1302.06009arXiv1008.4903OpenAlexW2030124182MaRDI QIDQ384722

Natalia Vanetik, Ruvim Lipyanski

Publication date: 28 November 2013

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

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

zbMATH Keywords

finite latticesalgebraic latticesclassification problem for graphswild classification problems

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Free lattices, projective lattices, word problems (06B25)

Related Items (1)

Identical inclusions of semilattices

Cites Work

• Unnamed Item
• Homology of certain algebras defined by graphs
• Congruence lattices of finite \(p\)-algebras
• Complexity of matrix problems
• Isomorphisms of Graph Groups
• STACS 2005

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