ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ck\mathcal{C}_k and Pk\mathcal{P}_k denote the graph families of kk-th powers of cycles and paths, respectively, and let their B-Z constants be defined. B-Z constant equality conjecture. The B-Z constants of Ck\mathcal{C}_k and Pk\mathcal{P}_k are equal for all k≥1k\ge 1. This conjecture proposes that these two infinite graph families have identical exponential spanning-tree growth rates despite their different boundary structures; the supplied text does not indicate whether it has been resolved.

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.