benchmarks.wiki / Public workspace

Omni-MATH / Let B_(k)(n) be the largest possible number of elements in a 2-separable k-configuration of a set with 2n elements (2≤k≤n). Find a closed-form expression (i.e. an expression not in… · Discussion

Discussing Let B_(k)(n) be the largest possible number of elements in a 2-separable k-configuration of a set with 2n elements (2≤k≤n). Find a closed-form expression (i.e. an expression not in… · 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.