benchmarks.wiki / Public workspace

Omni-MATH / Suppose A has n elements, where n≥2, and C is a 2-configuration of A that is not m-separable for any m<n. What is (in terms of n) the smallest number of elements that C can have? · Discussion

Discussing Suppose A has n elements, where n≥2, and C is a 2-configuration of A that is not m-separable for any m<n. What is (in terms of n) the smallest number of elements that C can have? · 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.