Super-Magic Complete k-Partite Hypergraphs
- 50 Downloads
We deal with complete k-partite hypergraphs and we show that for all k≥2 and n≠2,6 its hyperedges can be labeled by consecutive integers 1,2,…,n k such that the sum of labels of the hyperedges incident to (k−1) particular vertices is the same for all (k−1)-tuples of vertices from (k−1) independent sets.
Unable to display preview. Download preview PDF.