Article by prof. Anholcer in European Journal of Combinatorics

A publication co-authored by dr hab. Marcin Anholcer was published in the European Journal of Combinatorics on 20.09.2023:

Anholcer, M., Bosek, B., Grytczuk, J. (2023), Majority choosability of countable graphs, European Journal of Combinatorics, 103829, ISSN 0195-6698,

https://doi.org/10.1016/j.ejc.2023.103829 (https://www.sciencedirect.com/science/article/pii/S0195669823001476) (https://authors.elsevier.com/a/1hnytiVNkInE4).

In this paper, the authors refer to the unfriendly partition hypothesis, in particular proving two theorems concerning majority coloring of  graphs and countably infinite digraphs.