A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into <i>K</i><sub>50</sub> (Q4452471)

From MaRDI portal





scientific article; zbMATH DE number 2041464
Language Label Description Also known as
default for all languages
No label defined
    English
    A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into <i>K</i><sub>50</sub>
    scientific article; zbMATH DE number 2041464

      Statements

      A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into <i>K</i><sub>50</sub> (English)
      0 references
      0 references
      0 references
      12 February 2004
      0 references
      disjoint factors
      0 references
      covering
      0 references
      voltage assignment
      0 references
      lift
      0 references
      Hoffman-Singleton graph
      0 references
      0 references

      Identifiers