Revision history of "1991 IMO Problems/Problem 4"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 14:37, 27 September 2008Cosinator (talk | contribs). . (3,543 bytes) (+3,543). . (New page: Suppose <math>\,G\,</math> is a connected graph with <math>\,k\,</math> edges. Prove that it is possible to label the edges <math>1,2,\ldots ,k\,</math> in such a way that at each vertex w...)
Invalid username
Login to AoPS