Covering radius conjecture for graph critical sets
Statement
Let be an undirected, connected multigraph with genus and vertices. Let , and be the three sets associated with the graph Laplacian, and let be the stated polytope. Covering radius conjecture for graph critical sets. For every , the covering radii of all three sets with respect to the distance function induced by are at least
The proposition preceding the conjecture identifies the relevant covering radii, while the conjecture extends the non-special-divisor formulation to the two critical sets.
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.