Erdős problem 1090
Let . Does there exist a finite set such that, in any -colouring of , there exists a line which contains at least points from , and all the points of on the line have the same colour?
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/1090.leanTrue ↔ ∀ (k : ℕ), 3 ≤ k → ∃ A, ∀ (C : ↥A → Fin 2), ∃ S, ∃ (hSA : S ⊆ A), Collinear ℝ ↑S ∧ S.card ≥ k ∧ (∀ y ∈ A, y ∈ affineSpan ℝ ↑S → y ∈ S) ∧ ∃ c, ∀ (x : Fin 2 → ℝ) (hx : x ∈ S), C ⟨x, ⋯⟩ = cProof manifests naming this Problem
- Jayyhk Erdős Lean
jayyhk:erdos:1090 - PLBY Lean proofs
ErdosProblems.Erdos1090
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI building on literature
- Machine