scientific article; zbMATH DE number 3448595

Cited in

(46)

Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
On functions of strength t
Studying designs via multisets
On the existence of BIB designs with large \(\lambda\)
Probabilistic existence of regular combinatorial structures
A construction of designs on \(n+1\) points from multiply homogeneous permutation groups of degree \(n\)
More on the Wilson \(W_{tk}(v)\) matrices
On the inclusion matrix \(W_{23}(v)\)
A reciprocity relation for t-designs
An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
Coloured and directed designs
Counting Steiner triple systems
A new proof of a classical theorem in design theory
Inclusion matrices and chains
Extension operations for cuts
Intersection theorems and mod \(p\) rank of inclusion matrices
A prospect for a general method of constructing \(t\)-designs
On three-designs of small order
The Manickam-Miklós-Singhi conjectures for sets and vector spaces
On trades and designs
On existence and number of orthogonal arrays
Simple signed Steiner triple systems
The exact bound in the Erdős-Ko-Rado theorem
Decompositions of edge-colored complete graphs
t-designs on hypergraphs
q-analogues of t-designs and their existence
t-designs from the large Mathieu groups
Tags on subsets
The family of t-designs. Part I
A survey on constructive methods for the Oberwolfach problem and its variants
Garland's method for token graphs
Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs
A construction for group divisible \(t\)-designs with strength \(t\geqslant 2\) and index unity
An extension theorem for Steiner systems
The family of t-designs. II
Graph and hypergraph packing
A diagonal form for the incidence matrices of t-subsets vs. k- subsets
On the Structure oft-Designs
The vector space generated by permutations of a trade or a design
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint)
Orthogonal arrays and ordered designs
On 1-factorizations of bipartite Kneser graphs
Combinatorics. Abstracts from the workshop held January 1--7, 2023
Recent progress in algebraic design theory
Some approaches for solving the general (t,k)-design existence problem and other related problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4774057)