Let r,g,b be non negative integers and Γ be a connected graph with r+g+b+1 vertices. Its edges are colored in red green and blue. It turned out that Γ containsA spanning tree with exactly r red edges.
A spanning tree with exactly g green edges.
A spanning tree with exactly b blue edges.Prove that Γ contains a spanning tree with exactly r red edges, g green edges and b blue edges. graph theoryRMM 2023combinatorics