Question: Let G be a bipartite graph with bipartition (X, Y ). Prove that the largest degree of a binomial which is part of a minimal set of homogeneous generators of P(G) is less than or equal to min(|X|, |Y |)? If G is a connected graph, then G has a spanning tree T , that is, there exists a tree T which is a spanning subgraph of G.