ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite graph with no pendant edges. Let a line be a metric line in GG, and let a bridge be an edge whose deletion disconnects GG. AMRZ line-and-bridge conjecture. In all graphs with no pendant edges, except for finitely many cases, the number of lines plus the number of bridges is at least the number of vertices. This remains open; the statement allows finitely many exceptional graphs.

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.