If you want to show that a graph has few edges, prove that not too many vertices can have large degree.
(The complementary statement is the main trick in the solution to this MO question, by way of example. It's also used in the proof of the Stanley-Wilf conjecture.)
