Smallest Fibonacci-run graph containing a hypercube
Statement
Let denote the -dimensional hypercube graph, and let denote the Fibonacci-run graph of parameter . Hypercube embedding conjecture. The smallest integer for which can be embedded into is
This is motivated by calculations from the cube-polynomial generating function and the claimed embeddings of in and in , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.