Article contents
On Extremal Set Partitions in Cartesian Product Spaces
Published online by Cambridge University Press: 12 September 2008
Abstract
The partition number of a product hypergraph is introduced as the minimal size of a partition of its vertex set into sets that are edges. This number is shown to be multiplicative if all factors are graphs with all loops included.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1993
References
- 3
- Cited by