ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an undirected, connected multigraph with genus g≥1g\geq 1 and n≥2n\geq 2 vertices. Let NG\mathcal{N}_G, Crit△(LG){\rm Crit}_{\triangle}(L_G) and Crit△ˉ(LG){\rm Crit}_{\bar{\triangle}}(L_G) be the three sets associated with the graph Laplacian, and let P1,λP_{1,\lambda} be the stated polytope. Covering radius conjecture for graph critical sets. For every λ∈[1/g,g]\lambda\in[1/g,g], the covering radii of all three sets with respect to the distance function induced by P1,λP_{1,\lambda} are at least

g/λn.\frac{\sqrt{g/\lambda}}{n}.

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 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.