qedbot

Erdős·erdos:1105

Erdős Problem 1105

problem formal record: solved source: proved F3 anchored

Machine-checked by Palomar.

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

graph theory, ramsey theory·Source

AI activity

How grades work
ChatGPT Deep research

19 Jan 2026·supporting task

Partial results found

partial A1 V1
Reasoning and sources

Autonomy

Secondary contribution: literature search

Aletheia

1 Feb 2026·supporting task

Full solution found; Gave some wrong references

full A1 V1
Reasoning and sources

Autonomy

Secondary contribution: literature search

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

Anchored to google-deepmind/formal-conjectures/blob/75a6d3d52d0b87e78317f2fcc37319d807779030/FormalConjectures/ErdosProblems/1105.lean

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

Checks

1
  • verified·Palomar

    Registered by Palomar at ba96303b: Comparator confirmed 8 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-13·commit ba96303b34a9

    PALOMAR-2026-10-13-000006

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős 1105: anti-Ramsey numbers for cycles and pathslinrock/math-proofs/erdos-1105 · 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
8 main results named, checked with Comparator, with an alignment table
sources
Anti-Ramsey theorems — formalizes, authors not-contacted; An anti-Ramsey theorem on cycles — adapts, authors not-contacted; Problems in graph theory and probability — adapts, authors not-contacted; On restricted colourings of K_n — background, authors not-contacted
divergences
None. Both universal statements preserve the exact quantifiers, domains (k >= 3 for cycles, n >= k >= 5 for paths), definitions (surjective TopEdgeLabeling on Fin n avoiding injective rainbow copies of cycleGraph k and pathGraph k), and formulas from Formal Conjectures.
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 1105: anti-Ramsey numbers for cycles and paths

    checked·their labels: registered

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

Cite this record

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

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