benchmarks.wiki / Public workspace

Omni-MATH / 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)³≤c⋅f(G)⁴ for every graph … · Discussion

Discussing 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)³≤c⋅f(G)⁴ for every graph … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.