Graph problem that is given as a graph problem, unusual
Source: Saint Petersburg MO 2020 Grade 9 Problem 7
May 7, 2020
combinatorics
Problem Statement
Let be a graph with vertices. For any edge we call a cuttlefish the set of all edges from and (including ). Each edge of the graph is assigned a value of or . It is known that the sum of edges at any cuttlefish is greater than or equal to .
Prove that the sum of the numbers at all edges is at least .