Combinatorics of symmetric designs
From MaRDI portal
(Redirected from Combinatorics of symmetric designs)
Recommendations
Cited in
(67)- Block designs with near-minimal number of blocks
- Symmetric designs, polarities and sub-designs
- Bruck-Ryser abstract theorem and symmetric designs
- On symmetric BIBDs with the same 3-concurrence
- On the metric dimension of incidence graphs
- Fully cotangent subsets of symmetric designs
- Balanced weighing matrices
- Some results on the Ryser design conjecture. III
- On the geography of line arrangements
- Jordan schemes
- Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
- Conditions for the parameters of the block graph of quasi-symmetric designs
- Triple arrays and Youden squares
- Design theory from the viewpoint of algebraic combinatorics
- Implementing Brouwer's database of strongly regular graphs
- Quasi-affine symmetric designs
- On the structure of 1-designs with at most two block intersection numbers
- Linearly embeddable designs
- An overview of embedding problems of quasi-residual designs
- Automorphism groups of a symmetric transversal design \(\text{STD}_2[12; 6]\)
- Inner balance of symmetric designs
- Decomposable symmetric designs
- Generalized conference matrices and projective planes
- On a class of optimal constant weight ternary codes
- Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
- Algebraic design theory
- A coset pattern identity between a 2n-p design and its complement
- scientific article; zbMATH DE number 3867331 (Why is no real title available?)
- Design theory
- Decomposable Symmetric Designs
- Suitable permutations, binary covering arrays, and Paley matrices
- New families of non-embeddable quasi-derived designs
- Nonexistence results for tight block designs
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 4021146 (Why is no real title available?)
- scientific article; zbMATH DE number 193109 (Why is no real title available?)
- Combinatorial Designs
- On the existence of \((v, k, \lambda)\) difference sets with \(k < 1250\) and \(k - \lambda\) is a square
- scientific article; zbMATH DE number 874487 (Why is no real title available?)
- Extrema of graph eigenvalues
- Some results on the Ryser design conjecture. II
- More on graphs with just three distinct eigenvalues
- On the metric dimension of imprimitive distance-regular graphs
- Some open questions about line arrangements in the projective plane
- On orthogonal matrices with zero diagonal
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- There are exactly five biplanes with k = 11
- On 1-factorizations of bipartite Kneser graphs
- On symmetric transversal designs STD\(_8[24; 3]\)'s
- Towards the Ryser–Woodall λ \lambda ‐design conjecture
- Extremal ternary self-dual codes of length 36 and symmetric 2-(36, 15, 6) designs with an automorphism of order 2
- Incidence‐free sets and edge domination in incidence graphs
- Exceptions and characterization results for type‐1 λ‐designs
- Some results on the Ryser design conjecture
- A note on -designs
- Clubs and their applications
- On a class of optimal constant weight codes
- On optimal constant weight codes derived from \(\omega\)-circulant balanced generalized weighing matrices
- Binary representations of regular graphs
- Some results on -design conjecture
- Resolving sets and split resolving sets of symmetric designs
- Regular two-distance sets
- Symmetric Hadamard matrices of order 116 and 172 exist
- Non-derivable strongly regular graphs from quasi-symmetric designs
- Eigenvalue multiplicity in triangle-free graphs
- Every SOMA\((n - 2, n)\) is Trojan
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
This page was built for publication: Combinatorics of symmetric designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5468889)
