A generalization of Sperner’s theorem and an application to graph orientations Original Research Article

A generalization of Sperner’s theorem is established: For a multifamily image of subsets of image in which the repetition of subsets is allowed, a sharp lower bound for the number image of ordered pairs image satisfying image and image is determined. As an application, the minimum average distance of orientations of complete bipartite graphs is determined.