Difference between revisions of "2022 SSMO Accuracy Round Problems/Problem 9"
(Created page with "==Problem== The graph <math>\Gamma</math> has <math>52</math> vertices labeled <math>A, A', B, B', \dots, Z, Z'</math>, such that <math>A</math> is not connected to <math>A'</...") |
(No difference)
|
Latest revision as of 13:04, 14 December 2023
Problem
The graph has vertices labeled , such that is not connected to , is not connected to , and so on. Suppose that all the vertices other than have different degrees (number of connections to the vertex). Find the sum of all possible values for the number of edges (connections) in .