Matrix product factorization conjecture for complete graphs of order 4n+1
Statement
Let be a complete graph on vertices, where
and both and are even. A graphical pair without loops consists here of graphs and that are -regular and -regular, respectively. Matrix product factorization conjecture. There is such a graphical pair satisfying
This asserts the existence of a matrix-product factorization of the complete graph under the stated evenness and regularity conditions. The supplied passage does not indicate whether the conjecture 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.