On t-designs - MaRDI portal

Cited in

(only showing first 100 items - show all)

Set systems with \(\mathcal L\)-intersections modulo a prime number
On set systems with restricted intersections modulo p and p-ary t-designs
New examples of Euclidean tight 4-designs
Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
Set systems with three intersections
A survey of some problems in combinatorial designs - a matrix approach
All rationals occur as exponents
An incidence algebra for t-designs with automorphisms
Sharp sets of permutations
Quasi-symmetric 2,3,4-designs
Inequalities for quasisymmetric designs
Fisher type inequalities for Euclidean t-designs
On set intersections
\(t{1\over 2}\)-designs
The family of t-designs. Part I
Extremal problems and coverings of the space
An intersection problem whose extremum is the finite projective space
On Sperner families in which no k sets have an empty intersection. III
Incidence matrices of t-designs
Intersection theorems with geometric consequences
A sharpening of Fisher's inequality
\(t\)-designs with few intersection numbers
Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
Inequalities and bounds for quasi-symmetric 3-designs
A recursive method for construction of designs
Eine Charakterisierung der (i,j)-Plane
Designs et hyperplans
Multilinear polynomials and a conjecture of Frankl and Füredi
New \(t\)-designs and large sets of \(t\)-designs
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
\((2s-1)\)-designs with \(s\) intersection numbers
5-designs with three intersection numbers
On block-transitive designs with affine automorphism group
High order intersection numbers of t-designs
Triangle-free Hamiltonian Kneser graphs
Extremal set systems with restricted \(k\)-wise intersections.
On designs in compact metric spaces and a universal bound on their size
Upper bounds for \(s\)-distance sets and equiangular lines
A common generalization to theorems on set systems with L-intersections
Nonexistence of nontrivial tight 8-designs
Extremal numbers for directed hypergraphs with two edges
The family of block designs with some combinatorial properties
Mac Williams identities and coordinate partitions
Polynomial spaces
Intersection theorems and mod p rank of inclusion matrices
On the inequalities of t-designs over a finite field
Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs)
The number of k-intersections of an intersecting family of r-sets
Inequalities for t designs
The family of t-designs. II
On the vector space of 0-configurations
On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
A new proof of several inequalities on codes and sets
Equidistant families of sets
Fractional L-intersecting families
Set systems with positive intersection sizes
An upper bound for the size of \(s\)-distance sets in real algebraic sets
Modular and fractional \(L\)-intersecting families of vector spaces
Properties of certain multi-angle tight frames in \(\mathbb{R}^d\)
An improved universal bound for \(t\)-intersecting families
Block-transitive automorphism groups on 2-designs with block size 4
On the number of edges of a uniform hypergraph with a range of allowed intersections
On tight 4-designs in Hamming association schemes
Parametric restrictions on quasi-symmetric designs
Energy bounds for codes in polynomial metric spaces
Regular intersecting families
Design theory from the viewpoint of algebraic combinatorics
Probabilistic existence of regular combinatorial structures
Threefold triple systems with nonsingular \(N_2\)
A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\)
Bounds on sets with few distances
Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number
The absolute bound for coherent configurations
A census of highly symmetric combinatorial designs
Around Borsuk's hypothesis
Fractional cross intersecting families
Intersecting families with sunflower shadows
On the number of zero-patterns of a sequence of polynomials
Erdös–Ko–Rado Theorem—22 Years Later
Nonexistence results for tight block designs
Bounds on the Maximum Number of Vectors with given Scalar Products
On the existence of tight relative 2-designs on binary Hamming association schemes
On the Structure oft-Designs
On weighted zero-sum sequences
A new short proof of the EKR theorem
A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials
Note on the tight relative 2-designs on \(H(n,2)\)
A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
On minrank and the Lovász theta-function
Quasi-symmetric designs with \(k\) numbers of intersection as unreduced designs
Sunflowers and L-intersecting families
An Upper Bound for Weak B_k-Sets
A recursive construction of t-wise uniform permutations
A lower bound for the number of blocks of t - (v,k, ) designs with t odd
On generalised \(t\)-designs and their parameters
Alon-Babai-Suzuki's inequalities, Frankl-Wilson type theorem and multilinear polynomials
Intersection numbers for subspace designs
Dualizing with respect to s-tuples
A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality

This page was built for publication: On t-designs

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