Partition of C4-designs into minimum and maximum number of P3-designs

Gaetano Quattrocchi, Zsolt Tuza

Research output: Article

3 Citations (Scopus)

Abstract

Let script C sign be a C4-design of order n and index λ, on the vertex set V, |V| = n. If V1 ∪⋯∪ Vm = V is a partition of the vertex set, such that the intersections of the C ε script C sign with Vi form a P3-design of order |Vi| and the same index λ, for each 1 ≤ i ≤ m, then 2 ≤ m ≤ log3(2n + 1). The minimum bound is best possible for every λ. The maximum bound is best possible for λ = 2, and hence also for every even λ.

Original languageEnglish
Pages (from-to)531-540
Number of pages10
JournalGraphs and Combinatorics
Volume20
Issue number4
DOIs
Publication statusPublished - nov. 1 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Partition of C<sub>4</sub>-designs into minimum and maximum number of P<sub>3</sub>-designs'. Together they form a unique fingerprint.

  • Cite this