No label defined (Q3789576)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4053627
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4053627

      Statements

      0 references
      0 references
      1987
      0 references
      indecomposable triple system
      0 references
      indecomposable partition problem
      0 references
      [For the entire collection see Zbl 0625.00011.] A triple system of order v and index \(\lambda\), denoted TS(v,\(\lambda)\), is a pair (V,B) consisting of a set V with v elements and a collection B of 3-subsets of V so that every 2-subset of V lies in precisely \(\lambda\) elements of B. A triple system is indecomposable if there is no proper nonempty subset B'\(\subset B\) so that (V,B') is a triple system. Given a partition \(\lambda_ 1+\lambda_ 2+...+\lambda_ r\) of v-2, the problem of determining whether or not the family of all 3-subsets of a v- set can be partitioned into subfamilies \(B_ 1,B_ 2,...,B_ r\) so that \((V,B_ i)\) is an indecomposable \(TS(v,\lambda_ i)\), for \(i=1,2,...,r\), is the indecomposable partition problem. The author provides a complete answer for all \(v\leq 10\), a construction that allows one to go from an indecomposable partition of order v to an indecomposable partition of order \(2v+1\), and a theorem which says that for any partition of v-2, when \(v=5\cdot 2^ i-1\), into parts of sizes 1 or 2, then the indecomposible partition problem has an affirmative answer.
      0 references

      Identifiers