On the number of sets in a null t-design

DOI10.1016/S0195-6698(83)80004-3zbMath0508.05018MaRDI QIDQ1837690

János Pach, Peter Frankl

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

subsetssymmetric differencenonidentical zero null t-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Triple systems (05B07)

Related Items

Reconstructing graphs from their k-edge deleted subgraphs, Minimum supports of eigenfunctions of graphs: a survey, Polytopes of roots of type A_N, General forbidden configuration theorems, Combinatorial \(S_ n\)-modules as codes, Combinatorial reconstruction problems, VC-saturated set systems, Forbidden configurations: Induction and linear algebra, Bounding one-way differences, A forbidden configuration theorem of Alon, The minimum volume of subspace trades, Kernels of modular inclusion maps, Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics, Inclusion matrices for rainbow subsets, A Sauer-Shelah-Perles lemma for lattices, Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph, The \(k\)-orbit reconstruction and the orbit algebra, On the volumes and affine types of trades, Minimal null designs of subspace lattices over finite fields, Traces of antichains, On functions of strength t, On disjointly representable sets, An extremal problem for Graham-Rothschild parameter words, On families in finite lattices, Density results for uniform families

Cites Work

• On the trace of finite sets
• On the vector space of 0-configurations
• On the density of families of sets
• The module structure of integral designs
• On the Structure oft-Designs
• Steiner Triple Systems Having a Prescribed Number of Triples in Common