On the support size of null designs of finite ranked posets

DOI10.1007/s004939970009zbMath0949.05006OpenAlexW2036059333MaRDI QIDQ1586352

Soojin Cho

Publication date: 13 November 2000

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004939970009

zbMATH Keywords

posetnull \(t\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorics of partially ordered sets (06A07) Extremal combinatorics (05D99)

Related Items (9)

Minimum supports of eigenfunctions of graphs: a survey ⋮ Minimum supports of eigenfunctions of Johnson graphs ⋮ Minimum supports of eigenfunctions in bilinear forms graphs ⋮ The minimum volume of subspace trades ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ Optimal functions with spectral constraints in hypercubes ⋮ Inclusion matrices for rainbow subsets ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph ⋮ Minimum supports of functions on the Hamming graphs with spectral constraints

This page was built for publication: On the support size of null designs of finite ranked posets