# Erdős Problem 740: Infinitary version of chromatic number and odd cycles

A statement in qed.bot, the register of claims of AI work in mathematics. The register grades the evidence attached to each claim; it never rules on whether a proof is correct.

- Identifier: erdos:740
- Collection: Erdős
- Page: https://qed.bot/s/erdos-740
- Formal record: open; at its source: open
- Machine-checked: no independent check has verified it
- Fidelity F0: Absent. No formal statement is attached to the result.
- Source: https://www.erdosproblems.com/740

## AI claims

No AI contribution is recorded against this statement.

## Claimed on erdosproblems.com

Proof claims posted on erdosproblems.com, which says that listing a claim is no guarantee of proof correctness. Nobody has examined them, and none counts in the register's totals.

- Johan Land, using GPT-6-Astra, Fable 5.1, Gemini-3.8-Flash: a full proof claimed, 6 Sep 2026. Autonomy A?, evidence V0. https://www.erdosproblems.com/forum/thread/740/proof-claims#proof-claim-267
- GPT 5.6 Sol, using GPT 5.6 Sol: a partial proof claimed, 16 Aug 2026. Autonomy A?, evidence V0. https://www.erdosproblems.com/forum/thread/740/proof-claims#proof-claim-205

## Formal statements

- FormalConjectures/ErdosProblems/740.lean, https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/740.lean

Cite as: qed.bot, "Erdős Problem 740: Infinitary version of chromatic number and odd cycles", https://qed.bot/s/erdos-740, as of 30 Sep 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/