erdős #1022
Is there a constant , where as , such that if is a finite family of finite sets, all of size at least , and for every set there are many with , then has chromatic number (in other words, has property B)?
Worked, still open.
combinatorics · solved · 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
No. In fact you can’t even have (c_t>2) for any $t$: for every $t$ there is a finite $(t+1)$-uniform family (\mathcal F) which is **not** 2‑colorable (has no property B) but still satisfies [ \forall X\qquad |\\{A\in\mathcal F:A\subseteq X\\}|\le 2|X|. ] So any admissible (c_t) would have to satisfy (c_t\le 2) for all …
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
solved