Connected graph w/ p=100
Source: 239 2008 J3
July 28, 2020
graph theorycombinatorics
Problem Statement
A connected graph has vertices, the degrees of all the vertices do not exceed and no two vertices of degree are adjacent. Prove that it is possible to remove several edges that have no common vertices from this graph such that there would be no triangles in the resulting graph.