qedbot

Erdős·erdos:836

Erdős Problem 836

problem formal record: solved source: open F3 anchored

Machine-checked by Palomar.

Fidelity F3: The project checks its proof with Comparator against a statement from the Erdős collection of a corpus written separately from the proof, and held here.

graph theory, hypergraphs, chromatic number·Source

AI activity

How grades work
GPT-5.5 Pro

27 Apr 2026

Candidate partial result (solution to second part)

candidate A3 V0
Reasoning and sources

Autonomy

AI standalone; human involvement recorded as non-significant

F3 anchored. The project checks its proof with Comparator against a statement from the Erdős collection of a corpus written separately from the proof, and held here.

Anchored to google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/836.lean

declares divergences from its source reviewed by an agent source authors not contacted

Checks

1
  • verified·Palomar

    Registered by Palomar at 2c2d2f77: Comparator confirmed 16 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-10-14·commit 2c2d2f773f1d

    PALOMAR-2026-10-14-000004

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős 836: vertex counts and pairwise edge intersections in 3-chromatic intersecting uniform hypergraphslinrock/math-proofs/erdos-836 · joined by anchor · Palomar

Read formalization.yaml

authors
Linmiao Xu
method
agent
review
agent-reviewed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
16 main results named, checked with Comparator, with an alignment table
sources
Problems and results on 3-chromatic hypergraphs and some related questions — formalizes, authors not-contacted; A Linear Intersection Bound — adapts, authors not-contacted; Erdős Problem 836 — independently-proves, authors not-contacted
divergences
None. Both erdos_836.parts.i and erdos_836.parts.ii match the Formal Conjectures statements directly, and all hypergraph uniformity, intersecting, and weak chromatic number predicates match the standard finite hypergraph definitions of Erdős and Lovász (1975) and erdosproblems.com/836.
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 · 2

Recorded elsewhere

Compare the registries
  • palomar — Erdős 836: vertex counts and pairwise edge intersections in 3-chromatic intersecting uniform hypergraphs

    checked·their labels: registered

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

Cite this record

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

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