Extremal graphs without three‐cycles or four‐cycles

We derive bounds for f(v) , the maximum number of edges in a graph on v vertices that contains neither three‐cycles nor four‐cycles. Also, we give the exact value of f(v) for all v up to 24 and constructive lower bounds for all v up to 200.