ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnkP_n^k denote the kkth power of the path graph on nn vertices, and let

G=Pnk□⋯□PnkG=P_n^k\mathbin{\square}\cdots\mathbin{\square}P_n^k

be the Cartesian product of mm copies of PnkP_n^k, with n≥4k+1n\geq 4k+1. The leverage-centrality count conjecture. The number of distinct leverage centralities in GG is

(m+k+1k+1).\binom{m+k+1}{k+1}.

The authors verified the analogous count computationally for small values of mm and kk, and the claim seeks the general formula for these Cartesian products.

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.