combi proof without induction
Source: Putnam 1956/B5
November 12, 2019
combinatoricsgraph theoryTuran s theorem
Problem Statement
Show that a graph with 2n points and edges necessarily contains a 3-cycle, but that we can find a graph with 2n points and edges without a 3-cycle.please prove it without induction .