The spectrum for large sets of ‐GDDs of type

DOI10.1002/JCD.21631MaRDI QIDQ4629795zbMATH OpenOpenAlexFDO

Authors Xiaolei Niu, H. Cao, Ramin Javadi

Publication date 28 March 2019

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.04364

zbMATH Keywords

large setsimplegroup divisible designgood large setlarge set with holes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Abstract: In this paper, we completely solve the existence of large sets of $(3,lambda)$-GDDs of type $g^u$ and the existence of a simple $(3,lambda)$-GDD of type $g^u$.

Recommendations

• The existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\)
• The spectrum of cyclic \((3, \lambda)\)-GDD of type \(g^v\)
• The 3-GDDs of type \(g^3u^2\)
• The spectrum of \((g \upsilon , g, 3, \lambda )\)-dDF in \(Z_{g \upsilon}\)
• scientific article; zbMATH DE number 6490101
• The spectrum for overlarge sets of directed \(P_3\)-decompositions
• On semi-cyclic (\(3, \lambda\))-GDDs of type \(g^t\)
• The spectrum of \((gv, g, 3, \lambda )\)-DF in \(Z_{gv}\)
• A pair of disjoint 3-gdds of type \(g^{t} u^{1}\)
• The spectrum for large sets of pure directed triple systems

Cited in

(5)

• scientific article; zbMATH DE number 398947 (Why is no real title available?)
• A generalization of group divisible t $t$‐designs
• Further results on large sets of disjoint group-divisible designs
• On semi-cyclic (\(3, \lambda\))-GDDs of type \(g^t\)
• Packing cliques in 3‐uniform hypergraphs

This page was built for publication: The spectrum for large sets of ‐GDDs of type

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