Erdős problem 750 · problems.science

Let $f(m)$ be some function such that $f(m)\to \infty$ as $m\to \infty$ . Does there exist a graph $G$ of infinite chromatic number such that every subgraph on $m$ vertices contains an independent set of size at least $\frac{m}{2}-f(m)$ ?

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#750
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI collaborating with humans
Erdős AI contributions wiki · 3 May, 2026
Machine
GPT-5.5 Pro
People
Przemek Chojecki
Open the source record
Formalization
Erdős AI contributions wiki · 4 May, 2026
Machine
Claude Code, Claude Opus 4.7, GPT-5.5 Pro
Open the source record
argument
VibeMathed
Machine
GPT-5.5 Pro
People
Przemek Chojecki
Reported outcome
resolved
Open the source record

Reported activity

Search problems.science