scientific article; zbMATH DE number 867473
From MaRDI portal
zbMath0836.00010MaRDI QIDQ4873725
No author found.
Publication date: 18 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Collections of articles of miscellaneous specific interest (00B15)
Related Items
Bounding the Optimal Rate of the ICSI and ICCSI problem, The Existence of Designs via Iterative Absorption: Hypergraph đč-designs for Arbitrary đč, On orthogonal orthomorphisms of cyclic and non-abelian groups. II, New large sets oft-designs with prescribed groups of automorphisms, There is no 2-(22, 8, 4) block design, Existence of (q, 7, 1) difference families with q a prime power, Further results on large sets of disjoint group-divisible designs with block size three and type 2n41, A technique for constructing nonâembeddable quasiâresidual designs, Trading crossings for handles and crosscaps, Pairwise balanced designs whose block size set contains seven and thirteen, Superâsimple resolvable balanced incomplete block designs with block size 4 and index 2, Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3, New Symmetric (61,16,4) Designs Obtained from Codes, Packings and Coverings of the Complete Bipartite Graph by Octagons, Merging Combinatorial Design and Optimization: the Oberwolfach Problem, m-Associate PBIB designs using Youden-m squares, Selfâdual codes and the (22,8,4) balanced incomplete block design, Efficiency balanced designs for bootstrap simulations, Forest leaves and four-cycles, Some new BIBDs with block size 7, Unnamed Item, There is no Drake-Larson finite linear space with three 7-lines and twenty-four 5-lines, Some infinite families of large sets of Kirkman triple systems, Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles, Asymptotic Enumeration of Difference Matrices over Cyclic Groups, New optimal covering arrays using an orderly algorithm, Algebraic Modelling of Covering Arrays, Unnamed Item, Unnamed Item, Modified frames with block size 3, Generalized steiner triple systems with group size five, ANTIMAGIC LABELING OF DIGRAPHS, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, More on regular linear spaces, Unnamed Item, Unnamed Item, Group Divisible Designs with Block Size Four and Group Type for, On the Independence Number of Steiner Systems, DoyenâWilson theorem for nested Steiner triple systems, Splitting balanced incomplete block designs with block size 3âĂâ2, A construction of resolvable nested 3âdesigns, On the maximum number of different ordered pairs of symbols in sets of latin squares, Special issue: 2nd Shanghai conference on designs, codes and finite geometries. Shanghai Jiao Tong Univ., Shanghai, China, May 14--18, 1996, Recent progress on the existence of perfect Mendelsohn designs, Diffuse difference triangle sets, A construction for infinite families of Steiner 3-designs, Unnamed Item, Quasiâembeddings of Steiner triple systems, or Steiner triple systems of different orders with maximum intersection, αâResolvable group divisible designs with block size three, Fast generation of regular graphs and construction of cages, Equivalence classes of central semiregular relative difference sets, Exploiting symmetries within constraint satisfaction search, Improved Bounds for Uniform Hypergraphs without Property B, On the chromatic spectrum of acyclic decompositions of graphs, A Class of 2â(3n7, 3nâ17, (3nâ17â1)/2) Designs, Strongly regular \((\alpha,\beta)\)-geometries, Rainbow decompositions, A formula for the number of Steiner quadruple systems on 2n points of 2ârank 2nân, On completing latin squares, Existence of (q,k, 1) difference families withq a prime power andk = 4, 5, The geometry of frequency squares, Recursive constructions for 3-designs and resolvable 3-designs, Self-converse Mendelsohn designs with block size 4 and 5, The 3-way flower intersection problem for Steiner triple systems, Some new results on superimposed codes, On the generalized Oberwolfach problem, The fine structures of three Latin squares, Optimal holey packings OHP4(2, 4, n ,3)'s, Products of mixed covering arrays of strength two, Restricted bâfactors in bipartite graphs and tâdesigns, A sensitive algorithm for detecting the inequivalence of Hadamard matrices, Atomic Latin squares of order eleven, 4â*GDDs(3n) and generalized Steiner systems GS(2, 4, v, 3), Covering arrays with mixed alphabet sizes, Incomplete group divisible designs with block size four, Constructions of optimal packing and covering of the complete multigraph with applications, Common intersection designs, Embedding a latin square in a pair of orthogonal latin squares, Direct constructions for cyclically relative difference matrices with five rows, Faultâtolerant routings with minimum optical index, Interaction detection in Latin and Hyper-latin squares, Combinatorial problems motivated by commaâfree codes, On the existence of a PBD(30,{4,5,7,8*}), A group extensions approach to relative difference sets, Resolvable modified group divisible designs with block size three, Constructions of 2-cover-free families and related separating hash families, Frequency permutation arrays, FlagâTransitive 2â Symmetric Designs with Sporadic Socle, Orthogonal group divisible designs of typehn forhââ€â6, IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation, Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks, Towards a Theory of Intrusion Detection, Threshold Group Testing, Self-orthogonal decompositions of graphs into matchings, Classification of flag-transitive symmetric designs, PBIB Designs and Their Association Schemes Arising from Minimum Bi-Independent Dominating Sets of Circulant Graphs, A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters, On the bound for anonymous secret sharing schemes, A survey on maximum distance holey packings, Projective planes and congestion-free networks, Latin squares with self-orthogonal conjugates, Grooming in unidirectional rings: \(K_{4}-e\) designs, On the chromatic index of path decompositions, Problems and algorithms for covering arrays, The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors, A new quasi-symmetric 2-(56,\,16,\,6) design obtained from codes, Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\), A systematic approach to some block design constructions, Cocyclic Hadamard matrices and Hadamard groups are equivalent, Anonymous secret sharing schemes, Orthogonal double covers of complete graphs by trees, Covering arrays from \(m\)-sequences and character sums, On the maximum number of fixed points in automorphisms of prime order of 2-\((v,k,\text 1)\) designs, Ideal ramp schemes and related combinatorial objects, Ranks of matrices with few distinct entries, Resolvable group divisible designs with block size four and group size six, The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs., A new series of large sets of subspace designs over the binary field, The characterization problem for designs with the parameters of \(\mathrm{AG}_d(n,q)\), Configuration space of geometric objects, Mandatory representation designs MRD(\(\{4,k\};v\)) with \(k\equiv 1 \mod 3\), Constructions of difference covering arrays., Constructions of uniform designs by using resolvable packings and coverings., On some infinite series of \((r,1)\)-designs, Counting symmetric configurations \(v_3\), Bipartite rainbow Ramsey numbers., Diagonally cyclic Latin squares., On Kirkman packing designs KPD\((\{3,4\},v)\)., Existence of optimal strong partially balanced designs with block size five., Combinatorial constructions for optimal supersaturated designs., A survey on resolvable group divisible designs with block size four., On group-divisible designs with block size four and group-type \(6^{u} m^{1}\)., HGDDs with block size four., On large sets of Kirkman triple systems and 3-wise balanced design., New combinatorial designs and their applications to authentication codes and secret sharing schemes., Minimum embedding of balanced \(P_{4}\)-designs into 5-cycle systems., Existence of incomplete resolvable minimum coverings of pairs by triples., Orthogonal double covers of \(K_{n,n}\) by small graphs., Configurations between geometry and combinatorics., Spectrum of directed Kirkman packing designs, Embeddings of resolvable triple systems, Intersecting designs, Asymptotically optimal erasure-resilient codes for large disk arrays., Cocyclic Hadamard matrices and difference sets, An introduction to cocyclic generalised Hadamard matrices, Homogeneous bent functions, Unital designs in planes of order 16, Existence of whist tournaments with the three-person property 3PWh\((v)\), On symmetric nets and generalized Hadamard matrices from affine designs, Construction of 3-designs using parallelism, Algebraic techniques for covering arrays and related structures, New parallelisms of \(\mathrm{PG}(3, 4)\), An efficient design and implementation of the in-parameter-order algorithm, An effective greedy heuristic for the social golfer problem, An improved SAT formulation for the social golfer problem, On primitivity and reduction for flag-transitive symmetric designs, Equivalence classes of matchings and lattice-square designs, Group divisible designs with block sizes from \(K_{1(3)}\) and Kirkman frames of type \(h^u m^1\), Permutation groups arising from pattern involvement, Some new \(\mathbb{Z}\)-cyclic whist tournament designs, Frame self-orthogonal Mendelsohn triple systems, On distance in some finite planes and graphs arising from those planes, Disjoint blocks in a \(\mathrm{MOL}(6)\), A lower bound on HMOLS with equal sized holes, Orthogonal decomposition and packing of complete graphs, The problem of Euler/Tarry revisited, Covering graphs: The covering problem solved, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Starters and related codes, Topological models for classical configurations, Steiner graphical \(t\)-wise balanced designs of type \(n^r\), Mandatory representation designs MR\((3, k; \upsilon)\) with \(k\) even and \(\upsilon\) odd, Sets of type-\((1,n)\) in biplanes, Truncated transversal designs: A new lower bound on the number of idempotent MOLS of side \(n\), Kirkman packing designs KPD(\(\{w,s^{\ast}\},v \)) and related threshold schemes, Perfect Graeco-Latin balanced incomplete block designs (pergolas), Bounds on the number of affine, symmetric, and Hadamard designs and matrices, Modified group divisible designs with block size 4 and \(\lambda=1\), New infinite families of 3-designs from Preparata codes over \(\mathbb{Z}_4\), Extremal double circulant type II codes over \(\mathbb Z_4\) and construction of 5-(24,10,36) designs., Optimal factorizations of families of trees, The uniformity space of hypergraphs and its applications, A class of functions and their application in constructing semi-biplanes and association schemes, Mendelsohn directed triple systems, Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative, The geometric reason for the non-existence of a MOL(6), Decompositions of difference sets, Pooling, lattice square, and union jack designs, Sets pooling designs, Invariant codes, difference schemes, and distributive quasigroups, Quorum systems constructed from combinatorial designs, Systematic enumeration of definitive screening designs, The existence theorem for group divisible designs of large order, Group-divisible designs with block size four and group-type \(g^um^1\) with \(m\) as large or as small as possible, A general construction for optimal cyclic packing designs, Uniquely 3-colourable Steiner triple systems, Hadamard and conference matrices, The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs, The packings of \(\mathrm{PG}(3,3)\), An application of ramp schemes to broadcast encryption, Equidistant frequency permutation arrays and related constant composition codes, The tournament scheduling problem with absences, Construction of 3-designs using \((1,\sigma)\)-resolution, Graph homomorphisms and nodal domains, Flag-transitive non-symmetric 2-designs with \((r,\lambda)=1\) and sporadic socle, On the intersection problem for Steiner triple systems of different orders, Imprimitive flag-transitive symmetric designs, Further combinatorial constructions for optimal frequency-hopping sequences, A construction method for optimally universal hash families and its consequences for the existence of RBIBDs, Constructions and bounds for \((m,t)\)-splitting systems, On the existence of difference sets in groups of order 96, Modular representation theory of BIB designs, Constructing \(t\)-designs from \(t\)-wise balanced designs, Maximum transversal in partial Latin squares and rainbow matchings, Packing arrays, Representations of disjoint unions of complete graphs, Large sets and overlarge sets of triangle-decomposition, Complete enumeration and properties of binary pseudo-Youden designs PYD\((9,6,6)\), Edge coloring complete uniform hypergraphs with many components, Equiangular tight frames and signature sets in groups, On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs, Two new perspectives on multi-stage group testing, Existence of three HMOLS of types \(h^ n\) and \(2^ n3^ 1\), General frame constructions for \(\mathbb{Z}\)-cyclic triplewhist tournaments, Enriched homology and cohomology modules of simplicial complexes, A note on binary completely regular codes with large minimum distance, Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\), Half quasigroups and generalized quasigroup orthogonality., A note on list-coloring powers of graphs, Characterizing geometric designs. II., Fixed block configuration group divisible designs with block size six, Equiangular lines and covers of the complete graph, To the theory of \(q\)-ary Steiner and other-type trades, Optimal difference systems of sets and partition-type cyclic difference packings, Structures and lower bounds for binary covering arrays, Construction of optimal ternary constant weight codes via Bhaskar Rao designs, Constructing strength three covering arrays with augmented annealing, All graphs with maximum degree three whose complements have 4-cycle decompositions, Rectangular table negotiation problem revisited, Extra two-fold Steiner pentagon systems, Biplanes with flag-transitive automorphism groups of almost simple type, with exceptional socle of Lie type., Some existence and construction results of polygonal designs, Equivalence classes of multiplicative central \((p^{n}, p^{n}, p^{n}, 1)\)-relative difference sets, Spectrum of sizes for perfect 2-deletion-correcting codes of length 4, Group divisible designs with block size four and group type \(g^um^1\), Primitive decompositions of Johnson graphs, Using solution properties within an enumerative search to solve a sports league scheduling problem, Almost self-complementary 3-uniform hypergraphs, Constructions of almost difference families, A classification of flag-transitive 2-designs with \(\lambda \geq (r,\lambda)^2\) and sporadic socle, The existence of perfect \(T(K_{1,2p})\)-triple systems, On minimally \(k\)-connected matroids, Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges, Exceptional groups of Lie type and flag-transitive triplanes, Embedding a Latin square with transversal into a projective space, A generalization of plexes of Latin squares, The metamorphosis of lambda-fold block designs with block size four into lambda-fold triple systems, Holey Steiner pentagon systems and related designs, Candelabra systems and designs, A sign test for detecting the equivalence of Sylvester Hadamard matrices, The spectrum of optimal strong partially balanced designs with block size five, Maximal arc partitions of designs, Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design, \(k\)-pyramidal one-factorizations, Latin bitrades derived from groups, Mandatory representation designs MRD(4\(,k;v\)) with \(k\equiv 2\) mod 3, The spectrum of \(\text{Meta}(K_3+e> P_4, \lambda)\) and \(\text{Meta}(K_3+e> H_4, \lambda)\) with any \(\lambda \), The Sylvester-Gallai theorem, colourings and algebra, Oberwolfach rectangular table negotiation problem, Hexagon kite systems, A constraint on the biembedding of Latin squares, Linear spaces with small generated subspaces, Some more 5-GDDs, 4-frames and 4-RGDDs, On the existence of nearly Kirkman triple systems with subsystems, Bundles, presemifields and nonlinear functions, Kirkman frames having hole type \(h^u m^1\) for small \(h\), A tripling construction for overlarge sets of KTS, Construction of minimum generalized aberration designs, Group divisible designs with two associate classes: \(n=2\) or \(m=2\), New designs with block size 7, Reconstructing subsets of \(\mathbb{Z}_n\), Kirkman covering designs with even-sized holes, Resolvable group divisible designs with block size four and general index, The minimum likely column cover problem, Further results on overlarge sets of Kirkman triple systems, Dynamic structural symmetry breaking for constraint satisfaction problems, Optimization, block designs and no free lunch theorems, Sporadic groups and flag-transitive triplanes, Perfect dexagon triple systems with given subsystems, Generalized weighing matrices and self-orthogonal codes, Minimum embedding of a \(P_{4}\)-design into a balanced incomplete block design of index \(\lambda \), Finite classical groups and flag-transitive triplanes, Constructions of optimal quaternary constant weight codes via group divisible designs, Applications of additive sequence of permutations, Scheduling CCRR tournaments, Resolvable group divisible designs with block size four and index three, Decomposing oriented graphs into transitive tournaments, Constructions of irredundant orthogonal arrays, Covering schemes of strength \(t\), Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms, On elementary, odd, semimagic and other classes of antilattices, A survey of metaheuristic algorithms for the design of cryptographic Boolean functions, EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA, Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues, On girth-biregular graphs, The sumo coach problem, Cyclic cycle systems of the complete multipartite graph, Almost resolvable perfect Mendelsohn designs with block size five, Invariants for EA- and CCZ-equivalence of APN and AB functions, Transversals and multicolored matchings, Cube factorizations of complete graphs, Sets of type-\((1,n)\) in symmetric designs for \(\lambda \geq 3\), On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\), VNS approach for solving a financial portfolio design problem, MaxMinSum Steiner Systems for Access Balancing in Distributed Storage, Unnamed Item, On balanced incomplete-block designs with repeated blocks, Constructions for regular-graph semi-Latin rectangles with block size two, Orthogonal trades in complete sets of MOLS, The number of the non-full-rank Steiner quadruple systems \(S ( v , 4 , 3 )\), Threefold triple systems with nonsingular \(N_2\), There is no (46, 6, 1) block design, Covering arrays on product graphs, Directed B(K, 1;v) withK = {4, 5} and {4, 6} related to deletion/insertion-correcting codes, The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals, Construction of mutually unbiased bases using mutually orthogonal Latin squares, Flag-transitive quasi-residual designs with sporadic socle, Steiner systems for two-stage disjunctive testing, Two classes of optimal LRCs with information \((r, t)\)-locality, An existence theorem for group divisible 3-designs of large order, The Doyen--Wilson theorem for kite systems, The Terwilliger algebras of Johnson graphs, Equivalence classes of Latin squares and nets in \(\mathbb{CP}^{2}\), Coloured and Directed Designs, Circular neighbor-balanced designs universally optimal for total effects, Design of financial CDO squared transactions using constraint programming, The non-vanishing cohomology of Orlik-Solomon algebras, Steiner systems and configurations of points, Propagation algorithms for lexicographic ordering constraints, Biplanes with flag-transitive automorphism groups of almost simple type, with classical socle, Triplewhist tournaments with the three person property, On the existence of partitionable skew Room frames, The decomposition of \(K_v\) into \(K_2\times K_5\)'s, The spectrum for overlarge sets of directed triple systems, Minimum number of below average triangles in a weighted complete graph, Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs, Hexagon quadrangle systems, Minimum embedding of \(P_{3}\)-designs into \(\mathrm{TS}(v,\lambda )\), Directed complete bipartite graph decompositions: indirect constructions, Classification of some strongly regular subgraphs of the McLaughlin graph, Maximum packing for perfect four-triple configurations, Strength two covering arrays: existence tables and projection, The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class, Existence of (3, 1, 2)-conjugate orthogonal diagonal latin squares, Necessary existence criteria for mandatory representation designs MRD (4, k; Îœ), Bounds on the number of Hadamard designs of even order, Combinatorial solutions providing improved security for the generalized Russian cards problem, Graphs (networks) with golden spectral ratio, A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, Jacket transform eigenvalue decomposition, Compatibly ordered-OSTS of order \(n\) and compatibly ordered-OGDD of type \(h^n\) for \(n=6k+1\), Resolvable maximum packings with quadruples, A recursive construction for new symmetric designs, Non-full-rank Steiner quadruple systems \(S(v,4,3)\), On the structure of uniform one-factorizations from starters in finite fields, Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges, Existence of resolvable optimal strong partially balanced designs, Latin squares with bounded size of row prefix intersections, RHPMDs and FHPMDs with \(k=4\) and type \(4^u\), Coined quantum walks lift the cospectrality of graphs and trees, Generalized Steiner systems GS4 (2, 4, v, g) for g = 2, 3, 6, Uniform coverage designs for mixture experiments, Resolvable packings \(\widetilde{\text{R}}\text{MP}(3,2;n,n-3)\) and coverings \(\widetilde{\text{R}}\text{MC}(3,2;n,n-2)\), Decomposable symmetric designs, Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank, New \(\mathbb{Z}\)-cyclic triplewhist frames and triplewhist tournament designs, A novel use of \(t\)-packings to construct \(d\)-disjunct matrices, Classification of ternary extremal self-dual codes of length 28, A classification of the structures of some Sperner families and superimposed codes, Graph designs for all graphs with six vertices and eight edges, The construction of association schemes by parameter amendment, Enumeration of the doubles of the projective plane of order 4, Existence of HSOLSSOMs of type \(2^nu^1\), Arrays for combinatorial interaction testing: a review on constructive approaches, The structure of idempotent translatable quasigroups, On split graphs with four distinct eigenvalues, On unbalanced Boolean functions with best correlation immunity, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Embedding path designs into kite systems, Partitions of difference sets and code synchronization, Optimal partial clique edge covering guided by potential energy minimization, Cycle frames and the Oberwolfach problem, Pancomponented 2-factorizations of complete graphs, Brian Alspach and his work, Construction of strongly regular graphs using affine designs, Memetic collaborative approaches for finding balanced incomplete block designs, Trace-minimal graphs and D-optimal weighing designs, Classification of Steiner quadruple systems of order 16 and rank at most 13, Constructions of large sets of disjoint group-divisible designs \(\mathrm{LS}(2^n 4^1)\) using a generalization of \(^*\mathrm{LS}(2^n)\), Resolvable optimal strong partially balanced designs with block size four, On (\(g\), 4; 1)-difference matrices, Mutually orthogonal Latin squares with large holes, MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays, Novel constructions of mutually unbiased tripartite absolutely maximally entangled bases, $Q_4$-Factorization of $\lambda K_n$ and $\lambda K_x(m)$, On the state of strength-three covering arrays, Superpure digraph designs, Lotto design tables
