6 problems

First-player winning strategy conjecture. For $a\geq b\geq 3$, the first player has a winning strategy.

Let $N(n)$ be the smallest integer such that every set of $N(n)$ points in general position in the plane contains $n$ points in convex position. Happy-end conjecture. … The conject…

Let $ES_d(n)$ be the minimum integer $N$ such that every set of $N$ points in $\mathbb{R}^d$ in general position contains $n$ points in convex position. Füredi's conjecture. For ev…

Asymptotic equivalence conjecture. For all $m$ and $k$,

Leading-term conjecture. For all $m\geq k$, we have

Single-function conjecture. Assuming $k$-general position, every $k$th-order monotone finite set lies on the graph of a $k$-times differentiable function