ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K4n+1K_{4n+1} be a complete graph on 4n+14n+1 vertices, where

4n=m1⋅m24n=m_1\cdot m_2

and both m1m_1 and m2m_2 are even. A graphical pair ((G,g),(H,h))((G,g),(H,h)) without loops consists here of graphs GG and HH that are m1m_1-regular and m2m_2-regular, respectively. Matrix product factorization conjecture. There is such a graphical pair satisfying

K4n+1=Gg∗hH.K_{4n+1}=G_g\ast{}_h H.

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 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.