Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs (Q1168335)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
scientific article

    Statements

    Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    The authors tackle the following problem: given a family\(\{H_1,\dots,H_k\}\) of \(r\)-uniform hypergraphs, each with the same number of edges, find the smallest \(t\) such that each \(H_i\) can be decomposed into mutually isomorphic subhypergraphs \(E_{ij},1\leq j\leq t\). This study extends the authors' previous work on the case \(r=2\) [Combinatorica 1, 13-24 (1981)]. The main techniques used are interesting counting arguments. The results obtained are good but not sharp, so many open problems remain.
    0 references
    uniform hypergraphs
    0 references
    decompositions into isomorphic subhypergraphs
    0 references

    Identifiers