Abstract:
We obtain an upper bound for the $\alpha$-height of an arbitrary matrix of zeros and ones. We apply the result to a number of known combinatorial problems.
By a $(0,1)$ matrix here we mean an arbitrary matrix whose elements are zeros and ones.