The Balanced Bipartite Edge Count, and Three Anti-Ramsey Regimes

The Turán threshold for triangle-freeness, n²/4, is not merely a bound: it is the edge count of a specific graph, the balanced complete bipartite graph on n vertices. We prove the identity n/2 n/2 = n²/4 by a split on parity, so that the phrase ``one edge above the Turán threshold'' names an object rather than a quantity. Above that threshold the anti-Ramsey function for odd cycles falls into three regimes as the cycle length grows: constant at C₃, linear at C₅, and quadratic from C₇ onward. The three are a partition of the parameter, and the linear formula falls below the quadratic one from $n = 8$, so the transition at $k = 3$ is a change of order in n.