The bounded-degree rainbow independent-set conjecture
Let be the class of graphs whose vertex degrees are at most . Bounded-degree conjecture.
The source gives a general upper bound from graph colouring and says that this proposed value is not known to be sharp in general.
References
- Ron Aharoni, Joseph Briggs, Jinha Kim and Minki Kim, “Rainbow independent sets in certain classes of graphs”, arXiv:1909.13143 (2019).
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.