COLOR-BIAS PERFECT MATCHINGS IN HYPERGRAPHS

We study conditions under which an edge-colored hypergraph has a particular sub-structure that contains more than the trivially guaranteed number of monochromatic edges. Our main result solves this problem for perfect matchings under minimum degree conditions. This answers recent questions of Gishboliner, Glock, and Sgueglia and of Balogh, Treglown, and Z & aacute;rate-Guer & eacute;n.