weakened_cycle_ramsey_number
The weakened multicolour Ramsey number weakened_cycle_ramsey_number t ℓ of a cycle C_ℓ is the least integer n such that every t-edge-colouring of K_n contains a cycle of length ℓ using at most t - 1 colours.
Statement
noncomputable def weakened_cycle_ramsey_number (t ℓ : ℕ) : ℕ
- Defined in
- arXiv:2611.11187, Section 1
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- weakened_cycle_ramsey_propertyThe weakened cycle Ramsey property weakened_cycle_ramsey_property t ℓ n holds if every t-edge-colouring of the complete graph K_n contains…
- Used by 1
- not_op_1406_weakened_cycle_ramsey_number_ge_selfThe statement
op_1406_weakened_cycle_ramsey_number_ge_selfis false: The case t = 1 makes it false. weakened_cycle_ramsey_property t ℓ n…
- not_op_1406_weakened_cycle_ramsey_number_ge_selfThe statement
Read back from the Lean
The definition weakened_cycle_ramsey_number t ℓ is the infimum (least element in ℕ, or 0 if empty) of the set of natural numbers n such that weakened_cycle_ramsey_property t ℓ n holds.
Here, weakened_cycle_ramsey_property t ℓ n asserts that for every coloring c of the edges of the complete graph on Fin n with t colors (elements of Fin t), there exists a color j : Fin t such that the cycle graph of length ℓ (SimpleGraph.cycleGraph ℓ) is contained (SimpleGraph.IsContained) in the subgraph of the complete graph on Fin n formed by all edges whose color is not j.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The (t-1)-chromatic Ramsey number R^t_{t-1}(C_ℓ) of the cycle of length ℓ. -/ noncomputable def weakened_cycle_ramsey_number (t ℓ : ℕ) : ℕ := sInf {n : ℕ | weakened_cycle_ramsey_property t ℓ n}