Cover-Preserving Embeddings of Bipartite Orders into Boolean Lattices

Jutta Mitas 1 Klaus Reuter 2
1 PAMPA - Models and Tools for Programming Distributed Parallel Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We study the question which bipartite ordered sets are order preserving embeddable into two consecutive levels of a Boolean lattice. This is related to investigations on parallel computer architectures, where bipartite networks are embedded into hypercube networks. In our main Theorem we characterize these orders by the existence of a suited edge-coloring of the covering graph. We analyze the representations of cycle-free orders, crowns and glued crowns and present an infinite family of orders which are not embeddable. Their construction shows that this embeddability is not characterizable by a finite number of forbidden suborders.
Type de document :
[Research Report] RR-2512, INRIA. 1995
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:39:23
Dernière modification le : mercredi 11 avril 2018 - 02:00:54
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:06:14



  • HAL Id : inria-00074166, version 1


Jutta Mitas, Klaus Reuter. Cover-Preserving Embeddings of Bipartite Orders into Boolean Lattices. [Research Report] RR-2512, INRIA. 1995. 〈inria-00074166〉



Consultations de la notice


Téléchargements de fichiers