ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite connected graph with n=∣V(G)∣n=|V(G)| and n≥2n\geq 2, equipped with its graph metric. For distinct vertices u,vu,v, let the line LG(u,v)L_G(u,v) be the metric line determined by uu and vv, and call a line universal if it contains every vertex of GG. Graph De Bruijn–Erdős conjecture. Every finite connected graph with n≥2n\geq 2 has at least nn distinct lines, or has a universal line. This conjecture is the graph-metric special case of the metric-space conjecture and remains open.

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.