2-Colored Matchings in a 3-Colored K^{3}_{12}

Neal Bushaw, Peter Csorba, Lindsay Erickson +5

Let $K_n^r$ denote the complete $r$-uniform hypergraph on $n$ vertices. A matching $M$ in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…