Erdős Problem #1105
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (not automatically the live result).
Subject areas: graph theory, ramsey theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Colour every edge of a complete graph with as many distinct colours as possible, but avoid a rainbow copy of a particular graph. A copy is rainbow when all its edges have different colours.
The maximum number of edge colours avoiding a rainbow copy of \(H\) is the anti-Ramsey number \(\mathrm{AR}(n,H)\). Erdős Problem #1105 asks for formulas when \(H\) is a cycle \(C_k\) or a path \(P_k\).
A small example
Label the six vertices of \(K_6\) by \(0,1,\ldots,5\). Give each edge \(\{i,j\}\), with \(i<j\), the colour \(i\).
This uses five distinct colours. In any triangle with ordered vertices \(i<j<k\), the two edges \(\{i,j\}\) and \(\{i,k\}\) have the same colour \(i\). Thus no triangle is rainbow.
The construction proves \(\mathrm{AR}(6,C_3)\ge5\). Erdős, Simonovits and Sós established the matching general formula \(\mathrm{AR}(n,C_3)=n-1\); the simple colouring is only the lower-bound part of that theorem.
What is known
The maintained catalogue credits Montellano-Ballesteros and Neumann-Lara (2005) with an exact cycle formula implying, for fixed \(k\),
For paths \(P_k\), a more intricate exact formula is proposed when \(n\ge k\ge5\). It uses \(\ell=\lfloor(k-1)/2\rfloor\), a maximum of two expressions involving binomial coefficients, and a parity-dependent correction \(\varepsilon\).
The provenance of that path formula needs care. Earlier published results cover specific parameter ranges, including work of Simonovits and Sós (1984); the maintained page describes the all‑\(n\ge k\) formula as having been announced by Yuan (2021). An announcement should not be silently represented as an independently verified published proof.
GCL's current state
Authenticated source audit #2376 distinguishes cycles from paths and published results from the announced full path theorem. The exact six-vertex edge colouring has been computationally checked for every triangle.
The frozen formal-conjectures file labels both cases solved but its theorem bodies are not independently kernel-replayed by GCL.
What remains
Read the 1975 original, the 2005 cycle proof and the actual 2021 path manuscript. Verify all integer, parity and small‑\(k\) edge cases. Source-certify the full path theorem only after reviewing a complete proof.
Sources and claim boundaries
Erdős Problem #1105; Erdős–Simonovits–Sós (1975); Simonovits–Sós (1984); Montellano-Ballesteros–Neumann-Lara (2005); Yuan (2021), reported announcement; GCL audit #2376. These are externally reported results; the finite colouring is independently reproduced. This remains an unaccepted manuscript.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2376 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.