Prove that the order of every 3 regular planar graph containing no triangle or 4 cycle is at least 20.
Not sure how to do this problem. I know that because it has no triangle or 4 cycle each region must contain at least 5 edges. And then we have the formula for every connected plane graph of order n, size m and having r regions then
But I am not sure how to show $n\ge20$