Decompositions of hypergraphs into hyperstars (Q1106243): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:58, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decompositions of hypergraphs into hyperstars |
scientific article |
Statements
Decompositions of hypergraphs into hyperstars (English)
0 references
1987
0 references
P(X) (respectively \(P_ n(X))\) denotes the set of non-empty subsets (respectively n-element subsets) of a set X. A hyperstar with center F and size c is a hypergraph (X,E) such that \(F\subseteq \cap E\) and \(| E| =c\). A decomposition of a hypergraph \(H=(X,E)\) is a set of hypergraphs on set X whose edge sets form a partition of E. In this paper necessary and sufficient conditions are given for the existence of a decomposition of a hypergraph into hyperstars with given centers and sizes. These results are then applied to obtain sufficient conditions for the existence of a hyperstar decomposition of the hypergraphs (X,P(X)) and \((X,P_ n(X))\).
0 references
hyperstar
0 references
hypergraph
0 references
decomposition
0 references
hyperstar decomposition
0 references