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 pairing strategies in M...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-12-01
|
Series: | Acta Universitatis Sapientiae: Mathematica |
Subjects: | |
Online Access: | http://www.degruyter.com/view/j/ausm.2016.8.issue-2/ausm-2016-0015/ausm-2016-0015.xml?format=INT |