Akbari–Kano conjecture on two-valued factors of odd-regular graphs
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 paper records partial positive and negative results identifying ranges of and for which such factors must exist or can fail to exist.
References
2 papers in this index state this conjecture (2014–2016). The statement above is taken from the most recent of them; the others are arXiv:1410.1219.
Status
- Refuted: Maria Axenovich and Jonathan Rollin. Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs (Discrete Mathematics 338(12):2295–2301; arXiv:1410.1219, 2015) https://arxiv.org/abs/1410.1219
Source: Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan and Andrew J. Uzzell, “Regular colorings and factors of regular graphs”, arXiv:1603.09384 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.