Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Distance matrix polynomials of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Addressing Problem for Loop Switching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5663904 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new proof of a theorem of Graham and Pollak / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the decomposition ofkn into complete bipartite graphs / rank | |||
Normal rank |
Revision as of 19:20, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decomposition of the complete r-graph into complete r-partite r-graphs |
scientific article |
Statements
Decomposition of the complete r-graph into complete r-partite r-graphs (English)
0 references
1986
0 references
Let \(K_ r(n)\) be a complete r-partite hypergraph with n vertices. By \(f_ r(n)\) is denoted the minimal number q of pairwise edge-disjoint r- partite complete r-uniform hypergraphs which cover all edges of \(K_ r(n).\) In the paper is given an asymptotic value of the \(f_ r(n)\). For every fixed \(r\geq 1\) exist two positive numbers \(c_ 1(r)\) and \(c_ 2(r)\) such that \[ c_ 1\cdot n^{[r/2]}\leq f_ r(n)\leq c_ 2\cdot n^{[r/2]} \] for all \(n\geq r.\) The lower bound is proved using some methods of linear algebra and the upper bound is constructive. The construction is sharp for the case \(r=2,3\) where \(f_ 2(n)=n-1\) and \(f_ 3(n)=n-2\).
0 references
complete hypergraph
0 references
decomposition of hypergraph
0 references
complete r-partite hypergraph
0 references