✦ LIBER ✦

The dimension of the Cartesian product of partial orders

✍ Scribed by William T Trotter Jr.

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 546 KB
Volume: 53
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90146-3

No coin nor oath required. For personal study only.

✦ Synopsis

If P and Q are partial orders, then the dimension of the cartesian product P x Q does not exceed the sum of the dimensions of P and Q. There are several known sufficient conditions for this bound to be attained, on the other hand, the only known lower bound for the dimension of a cartesian product is the trivial inequality dim(P x Q) ~> max{dim P, dim O}. In partictdar, if P has dimension n, we know only that n ~~3, the crown S ° is an n-dimensional partial order for which dim(S°xS°)=2n-2. No example for which dim(Px Q) 3, la couronne S o est un ordre partiel de dimension n pour lequel dim(S°x S~)= 2n-2. On ne connait ancun exemple pour lequel dim(Px Q)<dimP+dim Q-2.

📜 SIMILAR VOLUMES

The dimension of the cartesian product o

The dimension of the cartesian product of posets

✍ Chiang Lin 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 775 KB

Lin, C., The dimension of the Cartesian product of posets, Discrete Mathematics 88 (1991) 79-92. We give a characterization of nonforced pairs in the Cartesian product of two posets, and apply this to determine the dimension of P X Q, where P, Q are some subposets of 2" and 2" respectively. One of

Partial orders of dimension 2

✍ K. A. Baker; P. C. Fishburn; F. S. Roberts 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 873 KB

Product partial orders with the sperner

Product partial orders with the sperner property

✍ Robert A. Proctor; Michael E. Saks; Dean G. Sturtevant 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 754 KB

Sufficient conditions are established for the product of two ranked partially ordered sets to have the Sperner property. As a consequence, it is shown that the class of strongly Sperner rank-unimodal rank-symmetric partially ordered sets is closed under the operation of product. Counterexamples are

The Cartesian product of hypergraphs

✍ Lydia Ostermeier; Marc Hellmuth; Peter F. Stadler 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

## Abstract We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a unique prime factor decomposition with respect to the (weak) Cartesian product, even if it has infinitely many factors. This generalizes previous results for graphs and undirected hypergraphs

Game coloring the Cartesian product of g

Game coloring the Cartesian product of graphs

✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat

The determining number of a Cartesian pr

The determining number of a Cartesian product

✍ Debra L. Boutin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract A set __S__ of vertices is a determining set for a graph __G__ if every automorphism of __G__ is uniquely determined by its action on __S__. The determining number of __G__, denoted Det(__G__), is the size of a smallest determining set. This paper begins by proving that if __G__=__G__□⋅