Unfriendly Partition Conjecture Holds for Line Graphs

A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex v and every color \(\alpha \), there are at most as many edges incident to v colored with \(\alpha \) as with all other colors. We extend some known results for finite graphs to infinite graphs, also in the list setting. In particular, we prove that every infinite graph without pendant edges has a majority edge-coloring from lists of size 4. Another interesting result states that every infinite graph without vertices of finite odd degrees admits a majority edge-coloring from lists of size 2. As a consequence of our results, we prove that line graphs of any cardinality admit majority vertex-colorings from lists of size 2, thus confirming the Unfriendly Partition Conjecture for line graphs.