Erdős·erdos:1105
Erdős Problem 1105
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 workPartial results found
Reasoning and sources
Autonomy
Secondary contribution: literature search
Sources
Full solution found; Gave some wrong references
Reasoning and sources
Autonomy
Secondary contribution: literature search
Sources
Fidelity
How fidelity is gradedF3 anchored. The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.
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
Declared by the projects
1As each project's formalization.yaml states it.
Erdős 1105: anti-Ramsey numbers for cycles and paths
- 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
- related
- google-deepmind/formal-conjectures/blob/75a6d3d52d0b87e78317f2fcc37319d807779030/FormalConjectures/ErdosProblems/1105.lean — builds-on; plby/lean-proofs/blob/cecc3fc4b7725db36692f0eca3c24712a481cfba/src/latest/ErdosProblems/Erdos1105.lean — independent
- 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 discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Recorded elsewhere
Compare the registries- palomar — Erdős 1105: anti-Ramsey numbers for cycles and paths
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.