Given a finite graph $G$, let $f(G)$ be the number of triangles in graph $G$, $g(G)$ be the number of edges in graph $G$, find the minimum constant $c$, so that for each graph $G$, there is $f^ 2(G)\le c \cdot g^3(G)$.
Source: China Northern MO 2023 p5 CNMO
Tags: inequalities, combinatorics, graph theory
Given a finite graph $G$, let $f(G)$ be the number of triangles in graph $G$, $g(G)$ be the number of edges in graph $G$, find the minimum constant $c$, so that for each graph $G$, there is $f^ 2(G)\le c \cdot g^3(G)$.