Pálvölgyi, Dömötör - Weak embeddings of posets to the Boolean lattice

dmtcs:4232 - Discrete Mathematics & Theoretical Computer Science, January 24, 2018, Vol. 20 no. 1
Weak embeddings of posets to the Boolean lattice

Authors: Pálvölgyi, Dömötör

The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs and of Patkos. As an equivalent reformulation of one of these problems, we also derive that it is NP-complete to decide whether a given graph can be embedded to the two middle levels of some hypercube.

Source : oai:arXiv.org:1606.08226
Volume: Vol. 20 no. 1
Section: Graph Theory
Published on: January 24, 2018
Submitted on: May 24, 2017
Keywords: Computer Science - Discrete Mathematics,Mathematics - Combinatorics


Browsing statistics

This page has been seen 50 times.
This article's PDF has been downloaded 14 times.