Aharoni–Briggs–Kim–Kim conjecture for cycles
Let be a cycle with vertices, and let denote the minimum number of independent -sets in whose collection has a rainbow independent -set. Aharoni–Briggs–Kim–Kim conjecture. If , then
This is the cycle case of the lower-bound conjecture for rainbow independent sets. The source states that Lv and Lu confirmed the assertion when , while the full range is not resolved there.
References
- Yue Ma, Xinmin Hou, Jun Gao, Boyuan Liu and Zhi Yin, “Rainbow independent sets in graphs with maximum degree two”, arXiv:2108.02520 (2021).
Progress summary
Never refreshed
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.