## 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
Cartesian Product of the Universal Covering Property
โ Scribed by Sang-Eon Han
- Publisher
- Springer Netherlands
- Year
- 2008
- Tongue
- English
- Weight
- 609 KB
- Volume
- 108
- Category
- Article
- ISSN
- 0167-8019
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## 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
## 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__โกโ
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