Remains a forest
Source: STEMS 2021 CS Cat B Q2
January 23, 2021
combinatoricsgraph theory
Problem Statement
Given two forests and with , that is the graphs are over same vertex set. Suppose has strictly more edges than . Prove that there exists an edge of which if included in the edge set of , then will still remain a forest. Graphs are undirected