The following pages link to On t-designs (Q1231915):
Displaying 50 items.
- Nonexistence results for tight block designs (Q356745) (← links)
- On the existence of tight relative 2-designs on binary Hamming association schemes (Q383342) (← links)
- On weighted zero-sum sequences (Q413569) (← links)
- A new short proof of the EKR theorem (Q423657) (← links)
- A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials (Q458607) (← links)
- Note on the tight relative 2-designs on \(H(n,2)\) (Q472965) (← links)
- A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes (Q492219) (← links)
- A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd (Q536229) (← links)
- On generalised \(t\)-designs and their parameters (Q539863) (← links)
- Alon-Babai-Suzuki's inequalities, Frankl-Wilson type theorem and multilinear polynomials (Q548388) (← links)
- Dualizing with respect to s-tuples (Q581404) (← links)
- A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality (Q584262) (← links)
- On subsets with cardinalities of intersections divisible by a fixed integer (Q585202) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Restricted \(t\)-wise \(\mathcal{L}\)-intersecting families on set systems (Q627935) (← links)
- Nonexistence of block-transitive 6-designs (Q644525) (← links)
- The maximum size of intersecting and union families of sets (Q657996) (← links)
- Block-transitive \(t\)-designs. I: Point-imprimitive designs (Q685593) (← links)
- The de Bruijn-Erdős theorem for hypergraphs (Q690671) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- A generalization of Connor's inequality to t-designs with automorphisms (Q757378) (← links)
- Families of finite sets with three intersections (Q761458) (← links)
- On functions of strength t (Q786818) (← links)
- Variations on seven points: An introduction to the scope and methods of coding theory and finite geometries (Q798320) (← links)
- On families in finite lattices (Q810551) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
- Intersection families and Snevily's conjecture (Q872042) (← links)
- On the existence of certain optimal self-dual codes with lengths between 74 and 116 (Q907221) (← links)
- An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs (Q912851) (← links)
- On minimally \(k\)-connected matroids (Q958691) (← links)
- Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version (Q962504) (← links)
- Cross \(\mathcal L\)-intersecting families on set systems (Q965946) (← links)
- On the Cameron-Praeger conjecture (Q966062) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- Set systems with \(\mathcal L\)-intersections modulo a prime number (Q1003627) (← links)
- On set systems with restricted intersections modulo \(p\) and \(p\)-ary \(t\)-designs (Q1011503) (← links)
- New examples of Euclidean tight 4-designs (Q1011507) (← links)
- Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families (Q1045081) (← links)
- Set systems with three intersections (Q1062054) (← links)
- A survey of some problems in combinatorial designs - a matrix approach (Q1076673) (← links)
- All rationals occur as exponents (Q1082340) (← links)
- An incidence algebra for t-designs with automorphisms (Q1104929) (← links)
- Sharp sets of permutations (Q1105023) (← links)
- Quasi-symmetric 2,3,4-designs (Q1109036) (← links)
- Inequalities for quasisymmetric designs (Q1113903) (← links)
- Fisher type inequalities for Euclidean t-designs (Q1119648) (← links)
- On set intersections (Q1138551) (← links)
- \(t{1\over 2}\)-designs (Q1139048) (← links)
- The family of t-designs. Part I (Q1146481) (← links)
- Extremal problems and coverings of the space (Q1153096) (← links)
