Generalized pairing strategies-a bridge from pairing strategies to colorings
In this paper we define a bridge between pairings and colorings of the hypergraphs by introducing a generalization of pairs called t-cakes for t ∈ ℕ, t ≥ 2.For t = 2 the 2-cakes are the same as the well-known pairs of system of distinct representatives, that can be turned to Swim pairing strategies in Maker-Breaker hypergraph games, see Hales