The cardinality bound for minimal rank-determining sets of metric graphs
Statement
Let be a metric graph of genus . A minimal rank-determining set is a rank-determining set of that has no proper subset that is rank-determining. Cardinality bound conjecture. Every minimal rank-determining set of has cardinality at most . This conjecture proposes a universal upper bound on the size of minimal rank-determining sets, following the construction of minimal rank-determining sets with points; whether all metric graphs satisfy this bound is left 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.