MathDB
combo graph inequality problem, f^ 2(G)<= c x g^3(G)

Source: China Northern MO 2023 p5 CNMO

May 5, 2024
inequalitiescombinatoricsgraph theory

Problem Statement

Given a finite graph GG, let f(G)f(G) be the number of triangles in graph GG, g(G)g(G) be the number of edges in graph GG, find the minimum constant cc, so that for each graph GG, there is f2(G)≤c⋅g3(G)f^ 2(G)\le c \cdot g^3(G).
Back to ProblemsView on AoPS