Additive combinatorial designs
Additive designs were introduced by \textit{A. Caggegi} et al. [J. Algebr. Comb. 45, No. 1, 271--294 (2017; Zbl 1440.05044)]. A 2-\((v, k, \lambda)\) design is additive if, up to isomorphism, the point set is a subset of an abelian group and every block is zero-sum. Additive designs are hard to construct in general, and it is particularly hard to construct additive Steiner 2-designs. In this work, the authors begin the study of additive \((K_v, \Gamma)\)-designs, as a generalization of additive Steiner 2-designs. An additive \((K_v, \Gamma)\)-design is a decomposition of the graph \(K_v\) into subgraphs \(B_1, \ldots , B_t\), all isomorphic to \(\Gamma\), such that the vertex set \(V(K_v)\) is a subset of an abelian group \(G\), and the sets \(V(B_1), \ldots , V(B_t)\) are zero-sum in \(G\). The authors develop various tools for constructing \((K_v, \Gamma)\)-designs and apply them to obtain infinite classes of designs and numerous sporadic examples. They consider various types of graphs \(\Gamma\), such as cycles, paths, and \(k\)-matchings. Further, the authors construct a sporadic additive 2-\((124, 4, 1)\) design.
- A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
- A second infinite family of Steiner triple systems without almost parallel classes
- A survey of Skolem-type sequences and Rosa’s use of them
- Additivity of affine designs
- Additivity of symmetric and subspace 2-designs
- Binary Hamming codes and Boolean designs
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cyclic one-factorization of the complete graph
- Cyclic relative difference families with block size four and their applications
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Existence of q-analogs of Steiner systems
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Graph decompositions in projective geometries
- Heffter spaces
- scientific article; zbMATH DE number 4123776 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 2188329 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- scientific article; zbMATH DE number 3325507 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- Latin squares with restricted transversals
- On perfect Γ-decompositions of the complete graph
- On the additivity of block designs
- On the existence of elementary Abelian cycle systems
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Sharply transitive decompositions of complete graphs into generalized Petersen graphs
- Steiner triple systems with high chromatic index
- Super-regular Steiner 2-designs
- The existence of cyclic \((v, 4, 1)\)-designs
- The existence of Latin squares without orthogonal mates
- The existence of optimal (v,4,1) optical orthogonal codes achieving the Johnson bound
- The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
This page was built for publication: Additive combinatorial designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944921)
