On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes

Niranjan Balachandran, Srimanta Bhattacharya

Let $n,r,k$ be positive integers such that $3\le k<n$ and $2\le r\le k-1$. Let $m(n,r,k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can…