Problem

Source: Iranian TST 2019, third exam day 2, problem 5

Tags: combinatorics



A sub-graph of a complete graph with $n$ vertices is chosen such that the number of its edges is a multiple of $3$ and degree of each vertex is an even number. Prove that we can assign a weight to each triangle of the graph such that for each edge of the chosen sub-graph, the sum of the weight of the triangles that contain that edge equals one, and for each edge that is not in the sub-graph, this sum equals zero. Proposed by Morteza Saghafian