Decompositions of hypergraphs into hyperstars
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))\).
- Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3726401 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Hyperclaw Decomposition of Complete Hypergraphs
- On claw-decomposition of complete graphs and complete bigraphs
- On the decomposition of a graph into stars
- On decomposition of hypergraphs into -systems
- A characterization of star-symmetric hypergraphs
- Partitions, packings and coverings by families with nonempty intersections
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- Solution of a delta-system decomposition problem
- On decomposing regular graphs into isomorphic double-stars
- Decomposition of large uniform hypergraphs
This page was built for publication: Decompositions of hypergraphs into hyperstars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106243)
