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...

Full description

Bibliographic Details
Main Authors:	Győrffy Lajos, Pluhár András
Format:	Article
Language:	English
Published:	Sciendo 2016-12-01
Series:	Acta Universitatis Sapientiae: Mathematica
Subjects:	positional games Chooser-Picker games k-in-a-row game pairing strategies hypergraph colorings 05C65 05C15
Online Access:	http://www.degruyter.com/view/j/ausm.2016.8.issue-2/ausm-2016-0015/ausm-2016-0015.xml?format=INT

id	doaj-art-031d764e023843e9946491a20b0017a7
recordtype	oai_dc
spelling	doaj-art-031d764e023843e9946491a20b0017a72018-09-02T12:37:15ZengSciendoActa Universitatis Sapientiae: Mathematica2066-77522016-12-018223324810.1515/ausm-2016-0015ausm-2016-0015Generalized pairing strategies-a bridge from pairing strategies to coloringsGyőrffy Lajos0Pluhár András1 Bolyai Institute, University of Szeged Department of Computer Science, University of SzegedIn 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 Maker-Breaker hypergraph games, see Hales and Jewett [12]. The two-colorings are the other extremity of t-cakes, in which the whole ground set of the hypergraph is one big cake that we divide into two parts (color classes). Starting from the pairings (2-cake placement) and two-colorings we define the generalized t-cake placements where we pair p elements by q elements (p, q ∈ ℕ, 1 ≤ p, q < t, p + q = t).http://www.degruyter.com/view/j/ausm.2016.8.issue-2/ausm-2016-0015/ausm-2016-0015.xml?format=INTpositional gamesChooser-Picker gamesk-in-a-row gamepairing strategieshypergraph colorings05C6505C15
institution	Open Data Bank
collection	Open Access Journals
building	Directory of Open Access Journals
language	English
format	Article
author	Győrffy Lajos Pluhár András
spellingShingle	Győrffy Lajos Pluhár András Generalized pairing strategies-a bridge from pairing strategies to colorings Acta Universitatis Sapientiae: Mathematica positional games Chooser-Picker games k-in-a-row game pairing strategies hypergraph colorings 05C65 05C15
author_facet	Győrffy Lajos Pluhár András
author_sort	Győrffy Lajos
title	Generalized pairing strategies-a bridge from pairing strategies to colorings
title_short	Generalized pairing strategies-a bridge from pairing strategies to colorings
title_full	Generalized pairing strategies-a bridge from pairing strategies to colorings
title_fullStr	Generalized pairing strategies-a bridge from pairing strategies to colorings
title_full_unstemmed	Generalized pairing strategies-a bridge from pairing strategies to colorings
title_sort	generalized pairing strategies-a bridge from pairing strategies to colorings
publisher	Sciendo
series	Acta Universitatis Sapientiae: Mathematica
issn	2066-7752
publishDate	2016-12-01
description	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 Maker-Breaker hypergraph games, see Hales and Jewett [12]. The two-colorings are the other extremity of t-cakes, in which the whole ground set of the hypergraph is one big cake that we divide into two parts (color classes). Starting from the pairings (2-cake placement) and two-colorings we define the generalized t-cake placements where we pair p elements by q elements (p, q ∈ ℕ, 1 ≤ p, q < t, p + q = t).
topic	positional games Chooser-Picker games k-in-a-row game pairing strategies hypergraph colorings 05C65 05C15
url	http://www.degruyter.com/view/j/ausm.2016.8.issue-2/ausm-2016-0015/ausm-2016-0015.xml?format=INT
_version_	1612643406115241984

Generalized pairing strategies-a bridge from pairing strategies to colorings

Similar Items