qedbot

Erdős·erdos:627

Erdős Problem 627

conjecture formal record: mixed source: open F2 declared

No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.

A Palomar registration names this problem. It is shown below but not counted as a check of the claim.

Fidelity F2: The correspondence is declared through an alignment table and written divergences.

graph theory, chromatic number·Source

AI activity

How grades work

No AI contribution recorded against this statement.

F2 declared. The correspondence is declared through an alignment table and written divergences.

declares divergences from its source reviewed by an agent

Checks

1
  • verified·Palomar

    Registered by Palomar at 4a98648f: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel. The project names this problem, which does not establish that it proves the result claimed here, so it is not counted as a check of it

    project registered at a pinned commit·2026-10-14·commit 4a98648f631e

    PALOMAR-2026-10-14-000006 — names this problem; not counted as a check of the claim

Declared by the projects

1

As each project's formalization.yaml states it.

Triangle-free graphs with prescribed chromatic numberAItoBit/erdos-627-palomar · joined by names · Palomar

Read formalization.yaml

authors
alexander
method
agent — OpenAI GPT-6 family via Codex
review
agent-reviewed (A separate Codex agent in the source-development task)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
sources
Sur le coloriage des graphs — formalizes, authors n/a; Erdős problem 627 — background, authors not-contacted
divergences
The source's informal every-k wording is restricted to k ≥ 2 because a graph with clique number two has an edge. Both invariants are exact. Fin n expresses finiteness, with n allowed to depend on k. The theorem realizes the same established variant through Mycielski's construction. It makes no claim about the extremal ratio's asymptotic limit.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 0

No proof artifact cited by the formal record.

Also known as · 3
  • https://www.erdosproblems.com/627
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/627.lean
  • FormalConjectures/ErdosProblems/627.lean

Cite this record

qed.bot, “Erdős Problem 627”, https://qed.bot/s/erdos-627, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.