2023 RMM, Problem 6
Source: 2023 RMM, Problem 6
March 4, 2023
graph theoryRMM 2023combinatorics
Problem Statement
Let be non negative integers and be a connected graph with vertices. Its edges are colored in red green and blue. It turned out that containsA spanning tree with exactly red edges.
A spanning tree with exactly green edges.
A spanning tree with exactly blue edges.Prove that contains a spanning tree with exactly red edges, green edges and blue edges.