Erdős problem 1105
The anti-Ramsey number is the maximum possible number of colours in which the edges of can be coloured without creating a rainbow copy of (i.e. one in which all edges have different colours).
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/1105.leanTrue ↔ ∀ (k : ℕ), 3 ≤ k → (fun n => ↑((SimpleGraph.cycleGraph k).antiRamseyNum n) - ((↑k - 2) / 2 + 1 / (↑k - 1)) * ↑n) =O[Filter.atTop] fun x => 1SolvedStatement only, no proof
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Partial literature extensions