erdős #838
Let be maximal such that any points in , with no three on a line, determine at least different convex subsets. Estimate - in particular, does there exist a constant such that
Worked, still open.
geometry · open · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Take an $n$-point set (P\subset\mathbb R^2) in **general position** (no three collinear). A “convex subset” here means a subset (Q\subseteq P) whose points are in **convex position** [[nomath]](equivalently: $Q$ is convexly independent; every point of $Q$ is a vertex of $\operatorname{conv}(Q)$)[[/nomath]]. This is the…
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
Create a formalisation here · link
status
open