« Vrati se
For a finite graph G, let f(G) be the number of triangles and g(G) the number of tetrahedra formed by edges of G. Find the least constant c such that

g(G)^3 \leq c\cdot f(G)^4

for every graph G.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
2304IMO Shortlist 2009 problem C80
2276IMO Shortlist 2008 problem C60
2159IMO Shortlist 2004 problem C62
2158IMO Shortlist 2004 problem C54
2105IMO Shortlist 2002 problem C72
2077IMO Shortlist 2001 problem C70