Akbari–Kano conjecture on two-valued factors of odd-regular graphs
Statement
Let be a positive odd integer, let satisfy , and let an -factor be a spanning subgraph in which every vertex has degree either or .
Akbari–Kano conjecture. Every -regular graph has an -factor.
The conjecture was disproved by Axenovich and Rollin. The paper records partial positive and negative results identifying ranges of and for which such factors must exist or can fail to exist.
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.