The CRC handbook of combinatorial designs
From MaRDI portal
Publication:3411976
Recommendations
Cited in
(only showing first 100 items - show all)- Constructions of biangular tight frames and their relationships with equiangular tight frames
- Self-complementary non-uniform hypergraphs
- Existence of \(t\) strongly symmetric pairwise orthogonal diagonal Latin squares for \(t\in\{3,4,5\}\)
- Minimum embedding of STSs into (K₃+e)-systems
- f-vectors of pure complexes and pure multicomplexes of rank three
- Zero-sum flows for Steiner systems
- On the existence of orthogonal arrays OA\((3,5,4n+2)\)
- Unifying some known infinite families of combinatorial 3-designs
- There exists no Steiner system \(S(4,5,17)\)
- Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)
- On relative \(t\)-designs in polynomial association schemes
- Block-avoiding point sequencings of arbitrary length in Steiner triple systems
- Flag-transitive 2-designs with \((r - \lambda ,k)=1\) and alternating socle
- Classifying 3- and 4-designs on 28 points invariant under the group \(S_6(2)\)
- Pairwise balanced designs with prescribed minimum dimension
- Mutually orthogonal rectangular gerechte designs
- Optimum detecting arrays for independent interaction faults
- A magic rectangle set on abelian groups and its application
- Mutually disjoint 5-designs from Pless symmetry codes
- On strongly regular signed graphs
- Number Cubes with Consecutive Line Sums
- Induction theorems for generalized Bhaskar Rao designs
- Four Mutually Orthogonal Latin Squares of Order 14
- The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
- Some more uniformly resolvable designs with block sizes 2 and 4
- Avoidance in bowtie systems
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Search for combinatorial objects using lattice algorithms -- revisited
- A new upper bound on the parameters of quasi-symmetric designs
- Generalized balanced tournament designs with block size four
- On the codegree density of complete 3-graphs and related problems
- Group divisible designs with two associate classes and \(\lambda_{2}=1\)
- A construction of variable strength covering arrays
- Coding with injections
- Recursive constructions for \(s\)-resolvable \(t\)-designs
- Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs
- Linked systems of symmetric designs
- Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths
- Resolvability of infinite designs
- On automorphism groups of a biplane (121,16,2)
- Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
- Self-dual codes from extended orbit matrices of symmetric designs
- Two unfortunate properties of pure $f$-vectors
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Probabilistic existence of regular combinatorial structures
- Divisible design digraphs
- Decompositions of complete graphs into blown-up cycles \(C_m\)[2]
- Vertex-transitive self-complementary uniform hypergraphs of prime order
- Exact embedding of two \(G\)-designs into a \((G+e)\)-design
- Switching codes and designs
- Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
- Doubly resolvable 4-cycle systems of \(2K_v\)
- Almost simple groups of Lie type and symmetric designs with prime
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- Generalized pentagonal geometries
- Linear integer programming approach to construction of balanced incomplete block designs
- A recursive construction of \(t\)-wise uniform permutations
- Existence of strongly symmetrical weakly pandiagonal Graeco-Latin squares
- Multimagic rectangles based on large sets of orthogonal arrays
- Infinite families of 2‐designs from a class of cyclic codes
- The combinatorial game \textsc{Nofil} played on Steiner triple systems
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- A construction for \(t\)-fold perfect authentication codes with arbitration
- On the directed Oberwolfach problem with equal cycle lengths
- Non-existence of point-transitive 2-(106, 6, 1) designs
- On the inclusion matrix \(W_{23}(v)\)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- Constructing heterogeneous hash families by puncturing linear transversal designs
- Flag-transitive point-quasiprimitive 2-(v,\, k,\, 2) designs
- The equivalence between optimal detecting arrays and super-simple OAs
- On triple systems and strongly regular graphs
- On the resolutions of cyclic Steiner triple systems with small parameters
- On resolvable Steiner 2-designs and maximal arcs in projective planes
- GBRDs over supersolvable groups and solvable groups of order prime to 3
- Group divisible designs with block size five
- A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
- Block designs signed over groups of order \(2^n 3^m\)
- Block-transitive designs in affine spaces
- Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
- Compatible difference packing set systems and their applications to multilength variable-weight OOCs
- Internal and external partial difference families and cyclotomy
- Counting Steiner triple systems with classical parameters and prescribed rank
- Signed graphs with at most three eigenvalues
- Enumerating Steiner triple systems
- Extremal regular graphs and hypergraphs related to fractional repetition codes
- Symmetry classes of quantum quasigroups
- Induced designs and fixed points
- Further results on mutually nearly orthogonal Latin squares
- Combinatorial constructions of packings in Grassmannian spaces
- Cycle frames and the Oberwolfach problem
- Unitals in projective planes of order 25
- Sets of mutually orthogonal Sudoku frequency squares
- Mutually orthogonal binary frequency squares
- Block designs and strongly regular graphs admitting a transitive action of the Mathieu group \(M_{11}\)
- Graph designs for the eight-edge five-vertex graphs
- Determination of the size of defining set for Steiner triple systems
- Further results on the existence of nested orthogonal arrays
- Designs having the parameters of projective and affine spaces
- Some new constructions of difference systems of sets
- Pentagonal geometries with block sizes 3, 4, and 5
This page was built for publication: The CRC handbook of combinatorial designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3411976)
