The Boolean rank of the uniform intersection matrix and a family of its submatrices

We study the Boolean rank of two families of binary matrices. The first is the binary matrix Ak,t that represents the adjacency matrix of the intersection bipartite graph of all subsets of size t of {1,2,...,k}. We prove that its Boolean rank is k for every k≥2t.