ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QnQ_n denote the nn-dimensional hypercube graph, and let Rm\mathcal{R}_m denote the Fibonacci-run graph of parameter mm. Hypercube embedding conjecture. The smallest integer mm for which QnQ_n can be embedded into Rm\mathcal{R}_m is

m=⌈5n−42⌉.m=\left\lceil\frac{5n-4}{2}\right\rceil.

This is motivated by calculations from the cube-polynomial generating function and the claimed embeddings of Q2m+1Q_{2m+1} in R5m+1\mathcal{R}_{5m+1} and Q2m+2Q_{2m+2} in R5m+3\mathcal{R}_{5m+3}, but the optimality assertion remains unproved in the supplied text.

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.