A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50

DOI10.1002/JCD.10049MaRDI QIDQ4452471zbMATH OpenOpenAlexFDO

Authors Jana Šiagiová, Mariusz Meszka

Publication date 12 February 2004

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.10049

zbMATH Keywords

liftcoveringvoltage assignmentHoffman-Singleton graphdisjoint factors

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(1)

• Some implications on amorphic association schemes

This page was built for publication: A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K₅₀

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452471)