ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rr and kk be integers with r≥kr\geq k. Consider the simplicial complex associated to the graph PC2r(2k−1)\mathcal{PC}_{2r}^{(2k-1)}, where PC2r(2k−1)\mathcal{PC}_{2r}^{(2k-1)} is the (2k−1)(2k-1)-st walk power of the projective cube PC2r\mathcal{PC}_{2r}. Connectivity conjecture. The associated simplicial complex is 22k2^{2k} connected. This is proposed as a strengthening of the walk-power chromatic-number conjecture, with algebraic-topological methods suggested as a possible approach; it remains open in the paper.

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.