ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D=(d1,d2,…,dt−1,dt,1,…,1)D=(d_1,d_2,\dots,d_{t-1},d_t,1,\dots,1) be a degree sequence with dt≥2d_t\geq 2 and d2≠2d_2\neq 2, and let GG be a unicyclic graph with degree sequence DD. Define

D′=(d1,d2,…,dt−1−1,dt−1,1,…,1)D'=(d_1,d_2,\dots,d_{t-1}-1,d_t-1,1,\dots,1)

and let G(D′)\mathcal{G}(D') be the greedy tree with degree sequence D′D'. If h(G(D′))h(\mathcal{G}(D')) is achieved by a unique leaf, set γ∗=2h(G(D′))−1\gamma^*=2h(\mathcal{G}(D'))-1; otherwise set γ∗=2h(G(D′))\gamma^*=2h(\mathcal{G}(D')). Optimal-girth conjecture. The Wiener index of GG satisfies

W(G)≥min⁡Gu(D,γ∗),C(D,γ∗).W(G)\geq\min\\{\mathcal{G}_u(D,\gamma^*),\mathcal{C}(D,\gamma^*)\\}.

This conjecture proposes that, without fixing the girth, a Wiener-minimizing unicyclic graph is captured by one of the two indicated constructions at the girth determined by the height of the associated greedy tree. The supplied text does not state a resolution, so the conjecture is recorded as 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 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.