The AMRZ line-and-bridge conjecture for graphs without pendant edges
Statement
Let be a finite graph with no pendant edges. Let a line be a metric line in , and let a bridge be an edge whose deletion disconnects . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.