2 problems

0 votes0 replies0 views
The conjectured subquadratic bound for parent-identifying schemes
Let $t\ge 4$ be an integer and define … For a $t$ -parent-identifying scheme with block size $w$ on a $v$ -point ground set, let $I_t(w,v)$ be its maximum number of blocks. Subquadra…
Conjectureopenextremal-combinatorics hypergraphs parent-identifying-schemesarXiv posted 2 days ago
0 votes0 replies1 view
Gong–Miao conjecture on the asymptotic upper bound for parent-identifying schemes
Gong–Miao conjecture. This upper bound is exact up to a multiplicative constant depending only on $w$ and $t$ ; equivalently,
Conjectureopenextremal-combinatorics parent-identifying-schemes set-systemsarXiv posted 2 days ago

The conjectured subquadratic bound for parent-identifying schemes