Design spectra for 6-regular graphs with 12 vertices
Abstract
The design spectrum of a simple graph G is the set of positive integers n such that there exists an edgewise decomposition of the complete graph Kn into n(n - 1)/(2 |E(G)|) copies of G. We compute the design spectra for 7788 6-regular graphs with 12 vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.