graph theory:

Do not just copy and paste the textbook solution. It makes no sense.

, pm and q - q1,..., q, be lists of nonnegative integers. The 1.4.32. Let p = P1, pair (p, q) is bigraphic if there is a simple bipartite graph in which pi..... Pm are the degrees for one partite set and q1..... 4, are the degrees for the other. When p has positive sum, prove that (p, q) is bigraphic if and only if (p',q') is bigraphic, where (p', q') is obtained from (p, q) by deleting the largest element from p and subtracting 1 from each of the largest elements of q. (Hint: Follow the method of Theorem 13.31.) , pm and q - q1,..., q, be lists of nonnegative integers. The 1.4.32. Let p = P1, pair (p, q) is bigraphic if there is a simple bipartite graph in which pi..... Pm are the degrees for one partite set and q1..... 4, are the degrees for the other. When p has positive sum, prove that (p, q) is bigraphic if and only if (p',q') is bigraphic, where (p', q') is obtained from (p, q) by deleting the largest element from p and subtracting 1 from each of the largest elements of q. (Hint: Follow the method of Theorem 13.31.)