Follow
The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size. (arXiv:2111.10393v1 [math.CO]) http://arxiv.org/abs/2111.10393
The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size. (arXiv:2111.10393v1 [math.CO]) http://arxiv.org/abs/2111.10393