benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let r be a positive integer. Show that if a graph G has no cycles of length at most 2r, then it has at most |V|²⁰¹⁶ cycles of length exactly 2016r, where |V| denotes the number of … · Discussion

Discussing Let r be a positive integer. Show that if a graph G has no cycles of length at most 2r, then it has at most |V|²⁰¹⁶ cycles of length exactly 2016r, where |V| denotes the number of … · 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.