Skip to content

Problem

erdos:617

∀ r ≥ 3, ∀ {V : Type} [inst : Fintype V] [DecidableEq V], Fintype.card V = r ^ 2 + 1 → ∀ (coloring : Sym2 V → Fin r), ∃ S k, S.card = r + 1 ∧ ∀ u ∈ S, ∀ v ∈ S, u ≠ v → coloring s(u, v) ≠ k

Declared status
falsifiable
Formalization
formalized
Subjects
graph theory
OEIS
N/A

Matching claims

0
No direct claims
This problem has no directly related claim record.

Search problems.science

Find a Problem, Result, source, or page