The De Bruijn–Erdős conjecture for finite connected graphs
Statement
Let be a finite connected graph with and , equipped with its graph metric. For distinct vertices , let the line be the metric line determined by and , and call a line universal if it contains every vertex of . Graph De Bruijn–Erdős conjecture. Every finite connected graph with has at least 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.