ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (V,d)(V,d) be a finite metric space with n=∣V∣n=|V| and n≥2n\geq 2. For distinct points x,y∈Vx,y\in V, let the line determined by xx and yy be the set consisting of xx, yy, and every point zz such that one of x,y,zx,y,z lies between the other two, where betweenness is defined by equality in the triangle inequality. De Bruijn–Erdős conjecture. Every finite metric space (V,d)(V,d) with n≥2n\geq 2 has at least nn distinct lines, or some line consists of all nn points. The conjecture is unresolved in general and remains open even for metric spaces arising from connected undirected graphs with unit edge lengths.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.