How many possible combinations of a bipartite graph given a degree constraint on one side?

735 Views Asked by At

How many bipartite graphs can I make with m nodes on the left and k nodes on the right, given that no nodes on the left may have more than y edges, where y < k, and every node must have at least 1 edge? The graphs do not need to be connected. What is the answer in terms of m, k, and y?