Countable graphs are majority 3-choosable

  title={Countable graphs are majority 3-choosable},
  author={John Haslegrave},
  journal={arXiv: Combinatorics},
  • John Haslegrave
  • Published 2020
  • Mathematics
  • arXiv: Combinatorics
  • The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that vertex as monochromatic ones. This is not known in general, but it is known that a 3-colouring with this property always exists. Anholcer, Bosek and Grytczuk recently gave a list-colouring version of this conjecture, and proved that such a colouring exists for lists of size 4. We improve their result to lists of size 3… CONTINUE READING


    Generalized Majority Colourings of Digraphs
    • 4
    • PDF
    Majority coloring of infinite digraphs
    • 2
    Unfriendly partitions of a graph
    • 57
    • PDF
    Majority Colourings of Digraphs
    • 6
    • PDF
    Majority choosability of countable graphs
    • 1
    • Highly Influential
    • PDF
    Majority Choosability of Digraphs
    • 6
    • PDF
    Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
    • 97
    • PDF
    Unfriendly partitions for graphs not containing a subdivision of an infinite clique
    • E. Berger
    • Mathematics, Computer Science
    • Comb.
    • 2017
    • 3
    Linear Bound for Majority Colourings of Digraphs
    • 5
    • PDF
    On decomposition of graphs
    • 160
    • PDF