On the support size of null designs of finite ranked posets
From MaRDI portal
Publication:1586352
DOI10.1007/s004939970009zbMath0949.05006MaRDI QIDQ1586352
Publication date: 13 November 2000
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004939970009
05B05: Combinatorial aspects of block designs
06A07: Combinatorics of partially ordered sets
05D99: Extremal combinatorics
Related Items
Minimum supports of eigenfunctions of graphs: a survey, Optimal functions with spectral constraints in hypercubes, Inclusion matrices for rainbow subsets, Minimum supports of eigenfunctions of Johnson graphs, Minimum supports of functions on the Hamming graphs with spectral constraints, On the cardinality spectrum and the number of Latin bitrades of order 3, Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph, The minimum volume of subspace trades, Minimum supports of eigenfunctions in bilinear forms graphs