Minimum covering for hexagon triple systems (Q1877360)

From MaRDI portal
Revision as of 08:48, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)





scientific article
Language Label Description Also known as
English
Minimum covering for hexagon triple systems
scientific article

    Statements

    Minimum covering for hexagon triple systems (English)
    0 references
    0 references
    0 references
    16 August 2004
    0 references
    The authors have recently obtained a complete solution to the problem of constructing perfect \(k\)-fold hexagon triple systems and perfect maximum packings of \(3k\)-fold \(K_n\) with hexagon systems [Discrete Math. 279, 325--335 (2004; Zbl 1043.05021)]. In the present paper the authors give a complete solution to the problem of constructing perfect minimum coverings of \(3k\)-fold \(K_n\) with hexagon triples.
    0 references
    hexagon triple system
    0 references
    perfect system
    0 references
    minimum covering
    0 references

    Identifiers