Exact embedding of two G-designs into a (G+e)-design

DOI10.1016/J.DISC.2011.03.010zbMATH Open1238.05171OpenAlexW2216789684MaRDI QIDQ658086FDOQ658086

Giorgio Ragusa, Gaetano Quattrocchi

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.010

Recommendations

• scientific article; zbMATH DE number 2061156
• On regular embedding of \(H\)-designs into \(G\)-designs
• Embedding of \(E_2\)-designs into 4-cycle systems
• scientific article; zbMATH DE number 1289753
• scientific article; zbMATH DE number 866667
• scientific article; zbMATH DE number 4051639
• A small embedding partial \(\boxtimes\)-designs into \(\{\boxtimes,\boxminus\}\)-designs
• Minimum embedding of P3-designs into (K4?e)-designs
• Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs
• A survey on the existence ofG-Designs

zbMATH Keywords

BIBDcycle systemscube systemspath designsstar designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph designs and isomorphic decomposition (05C51)

Cites Work

• The CRC handbook of combinatorial designs
• A theorem on flows in networks
• A survey on the existence ofG-Designs
• Title not available (Why is that?)
• Grooming for two-period optical networks
• Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
• Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs
• Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs

Cited In (2)

• Minimum embedding of STSs into \((K_3+e)\)-systems
• Title not available (Why is that?)

This page was built for publication: Exact embedding of two \(G\)-designs into a \((G+e)\)-design

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