Publication:3411976

zbMath1101.05001MaRDI QIDQ3411976

No author found.

Publication date: 1 December 2006

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

00B15: Collections of articles of miscellaneous specific interest

05Bxx: Designs and configurations

Related Items

On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks, Vertex-transitive self-complementary uniform hypergraphs, On uniformly resolvable designs with block sizes 3 and 4, A mathematical programming approach to the construction of BIBDs, Hadamard matrices of small order and Yang conjecture, Exponential bounds on the number of designs with affine parameters, Constructions of nets via OAs of strength 3 with a prescribed property, Bachelor latin squares with large indivisible plexes, Generalized covering designs and clique coverings, Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences, The number of Latin squares of order 11, On the existence of (3,λ)-semiframes of type 3^u, New families of non-embeddable quasi-derived designs, Lower bounds for two-period grooming via linear programming duality, On DRC covering — a survey, Cryptosystems involving one-factorizations of graphs, Rainbow and orthogonal paths in factorizations ofKn, Mutually orthogonal graph squares, The Hamilton-Waterloo problem for cycle sizes 3 and 4, Latin squares with no small odd plexes, Skew-Hadamard matrices of orders 436, 580, and 988 exist, Line spreads of PG(5, 2), A class of group divisible 3-designs and their applications, The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle, CLASSIFICATION OF NEAR-NORMAL SEQUENCES, Constructing heterogeneous hash families by puncturing linear transversal designs, A tabu search algorithm for the covering design problem, Optimal locating arrays for at most two faults, Friendship 3-hypergraphs, On triple systems and strongly regular graphs, Mutually orthogonal equitable Latin rectangles, A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6, Designs having the parameters of projective and affine spaces, Some 20-regular CDP(5,1;20\(u\)) and their applications, Two spectral characterizations of regular, bipartite graphs with five eigenvalues, Combinatorial bounds and characterizations of splitting authentication codes, Exotic complex Hadamard matrices and their equivalence, Mutually orthogonal Latin squares and mutually unbiased bases in dimensions of odd prime power MOLS and mubs in odd prime power dimensions, New tools for the construction of directed strongly regular graphs: difference digraphs and partial sum families, On parity vectors of Latin squares, 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\), Gregarious GDDs with two associate classes, On the existence of resolvable \((K_{3} + e)\)-group divisible designs, An enumeration of equilateral triangle dissections, Strongly regular graphs with non-trivial automorphisms, Optical grooming with grooming ratio nine, On the existence of orthogonal arrays OA\((3,5,4n+2)\), Computational complexity of reconstruction and isomorphism testing for designs and line graphs, Characterizing geometric designs. II., Classification of difference matrices over cyclic groups, Group divisible designs with two associate classes and \(\lambda_{2}=1\), On the existence of cycle frames and almost resolvable cycle systems, Strongly regular graphs constructed from \(p\)-ary bent functions, Optimization for simulation: LAD accelerator, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Sets of orthogonal hypercubes of class \(r\), On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph, Small embedding of an \(S_3(2,4,u)\) into an \(S_\lambda (2,4,u+w)\), Exact embedding of two \(G\)-designs into a \((G+e)\)-design, Switching codes and designs, Cyclic \((v;r,s;\lambda)\) difference families with two base blocks and \(v \leq 50\), Turyn type Williamson matrices up to order 99, The equivalence between optimal detecting arrays and super-simple OAs, Constructions of covering arrays of strength five, A construction for modified generalized Hadamard matrices using QGH matrices, On the number of designs with affine parameters, Steiner equiangular tight frames, Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8, Indivisible partitions of Latin squares, Twofold 2-perfect bowtie systems with an extra property, On constructions for optimal two-dimensional optical orthogonal codes, A new combinatorial approach to the construction of constant composition codes, Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\), There exists no Steiner system \(S(4,5,17)\), Constructions of new orthogonal arrays and covering arrays of strength three, Vertex-transitive self-complementary uniform hypergraphs of prime order, On the existence of maximum resolvable (\(K_{4} - e\))-packings, Decompositions of complete graphs into blown-up cycles \(C_m\)[2], Gbrds over groups of orders \(\leq 100\) or of order \(pq\) with \(p, q\) primes, On the Cameron-Praeger conjecture, Optical grooming with grooming ratio eight, The number of designs with geometric parameters grows exponentially, Block-transitive designs in affine spaces, Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices, Further results on the existence of splitting BIBDs and application to authentication codes, Optimal configurations for peer-to-peer user-private information retrieval, Strongly regular graphs associated with ternary bent functions, On the equivalence between real mutually unbiased bases and a certain class of association schemes, Quantum codes from caps, Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II, Cocyclic Hadamard matrices from forms over finite Frobenius rings, Generalized mix functions and orthogonal equitable rectangles, Explicit constructions for perfect hash families, Designs from subcode supports of linear codes, Generalized balanced tournament designs and related codes, A class of optimal constant composition codes from GDRPs, The existence of generalized mix functions, 2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes, Polarities, quasi-symmetric designs, and Hamada's conjecture, On orthogonal generalized equitable rectangles, Linear hash families and forbidden configurations, Optimal grid holey packings with block size 3 and 4, Commutative association schemes, Covering arrays avoiding forbidden edges, A construction of mutually disjoint Steiner systems from isomorphic Golay codes, Existence of generalized Bhaskar Rao designs with block size 3, Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs, Incongruent restricted disjoint covering systems, Near generalized balanced tournament designs with block sizes 4 and 5, Maximum uniformly resolvable designs with block sizes 2 and 4, Graph designs for the eight-edge five-vertex graphs, 3-colored 5-designs and \(\mathbb{Z}_4\)-codes, On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\), A new Yang number and consequences, Some characterizations of affinely full-dimensional factorial designs, Group divisible designs with three unequal groups and larger first index, Mixed covering arrays of strength three with few factors, Existence of resolvable H-designs with group sizes 2, 3, 4 and 6, Decomposition of complete multigraphs into crown graphs, The spectrum of 1-rotational Steiner triple systems over a dicyclic group, Completely reducible super-simple designs with block size four and related super-simple packings, Unifying some known infinite families of combinatorial 3-designs, An overview of embedding problems of quasi-residual designs, Automorphism groups of a symmetric transversal design \(\text{STD}_2[12; 6\)], Enhancing set constraint solvers with lexicographic bounds