Minimum embedding of P3-designs into (K4-e)-designs

Charles Colbourn, Alan C H Ling, Gaetano Quattrocchi

Research output: Contribution to journalArticle

26 Scopus citations

Abstract

A (K4 -e)-design on v w points embeds a P3-design on v points if there is a subset of v points on which the K4 -e blocks induce the blocks of a P3-design. It is shown that w ≤ 34 (v - 1). When equality holds, the embedding design is easily constructed. In this paper, the next case, when w 3 4 v, is settled with finitely many exceptions.

Original languageEnglish (US)
Pages (from-to)352-366
Number of pages15
JournalJournal of Combinatorial Designs
Volume11
Issue number5
DOIs
StatePublished - Dec 1 2003

    Fingerprint

Keywords

  • Embedding
  • Graph design
  • Resolvable design
  • Subdesign

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this