Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Chen, Atlas"'
Autor:
Bradshaw, Peter, Cao, Tianyue, Chen, Atlas, Dean, Braden, Gan, Siyu, Garcia, Ramon I., Krishnaiyer, Amit, McCourt, Grace, Murty, Arvind
We study the paintability, an on-line version of choosability, of complete multipartite graphs. We do this by considering an equivalent chip game introduced by Duraj, Gutowski, and Kozik. We consider complete multipartite graphs with $ n $ parts of s
Externí odkaz:
http://arxiv.org/abs/2411.19462