Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices

Grzegorz Herman. Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices. Reports on Mathematical Logic, 49:99-117, 2014. [doi]

Abstract

Abstract is missing.