Partition of C₄-designs into minimum and maximum number of P₃-designs

DOI10.1007/S00373-004-0582-ZMaRDI QIDQ704856zbMATH OpenOpenAlexFDO

Authors Gaetano Quattrocchi, Zsolt Tuza

Publication date 20 January 2005

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-004-0582-z

zbMATH Keywords

Cycle systemEmbeddingPath design

Mathematics Subject Classification ID

Other designs, configurations (05B30) Paths and cycles (05C38)

Recommendations

• Partitioning sets of quadruples into designs. III
• Minimum embedding of P3-designs into (K4?e)-designs
• Minimal clique partitions and pairwise balanced designs
• Partitioning sets of quadruples into designs. I
• scientific article; zbMATH DE number 4174938
• scientific article; zbMATH DE number 426159
• Publication:4735197
• Partitioning quadrics, symmetric group divisible designs and caps
• Existence of optimal strong partially balanced 3-designs with block size four
• scientific article; zbMATH DE number 4106852

Cited in

(2)

• Partitioning sets of quadruples into designs. III
• Exact embedding of two G-designs into a (G+e)-design

This page was built for publication: Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs

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