Vertex-partitions of 2-edge-colored graphs
J{\o}rgen Bang-Jensen, Francois Pirot, Anders Yeo

TL;DR
This paper investigates vertex partitions in 2-edge-colored graphs related to majority colorings, proving existence results for 4-majority partitions, NP-completeness for 3-majority partitions, and probabilistic conditions for balanced majority 3-partitions.
Contribution
It introduces the concept of k-majority partitions in 2-edge-colored graphs, establishing existence, computational complexity, and probabilistic conditions for such partitions.
Findings
Every 2-edge-colored graph has a 4-majority partition.
Deciding the existence of a 3-majority partition is NP-complete.
Graphs with certain degree conditions have balanced majority 3-partitions.
Abstract
A {\bf -majority coloring} of a digraph is a coloring of with colors so that each vertex has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same color as itself. Majority colorings have received much attention in the last years and many interesting open problems remain. Inspired by this and the fact that digraphs can be modelled via 2-edge-colored graphs we study several problems concerning vertex partitions of 2-edge-colored graphs. In particular we study vertex partitions with the property that for each every vertex has least as many edges of colour to vertices outside the set it belongs to as it has to vertices inside its own set. We call such a vertex partition with sets a {\bf -majority partition. Among other things we show that every 2-edge-coloured…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
