The computational complexity of decomposing block designs

Charles J. Colbourn, Marlene J. Colbourn

Research output: Contribution to journalArticle

Abstract

Deciding whether a (balanced incomplete) block design with λ = 3 can be decomposed, or partitioned, into block designs with smaller λ is shown to be NP-complete. The transformation employs known NP-completeness results on edge-partitioning graphs into triangles. The reduction also furnishes a construction of indecomposable triple systems with arbitrary odd λ, settling a question of Kramer.

Original languageEnglish (US)
Pages (from-to)345-350
Number of pages6
JournalNorth-Holland Mathematics Studies
Volume115
Issue numberC
DOIs
StatePublished - Jan 1 1985
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Mathematics(all)

Cite this