Options
Fast strategies in waiter-client games
Citation Link: https://doi.org/10.15480/882.3034
Publikationstyp
Journal Article
Date Issued
2020-09-18
Sprache
English
Institut
TORE-DOI
TORE-URI
Volume
27
Issue
3
Start Page
1
End Page
35
Article Number
P3.57
Citation
Electronic Journal of Combinatorics 3 (27): P3.57, 1-35 (2020)
Publisher DOI
Scopus ID
ArXiv ID
Publisher
EMIS ELibEMS
Waiter-Client games are played on some hypergraph (X,π), where π denotes the family of winning sets. For some bias b, during each round of such a game Waiter offers to Client b+1 elements of X, of which Client claims one for himself while the rest go to Waiter. Proceeding like this Waiter wins the game if she forces Client to claim all the elements of any winning set from π. In this paper we study fast strategies for several Waiter-Client games played on the edge set of the complete graph, i.e. X=E(Kn), in which the winning sets are perfect matchings, Hamilton cycles, pancyclic graphs, fixed spanning trees or factors of a given graph.
Subjects
Mathematics - Combinatorics
Mathematics - Combinatorics
05C57, 05C40, 05C05, 05C45
DDC Class
510: Mathematik
Publication version
publishedVersion
Loading...
Name
9451-PDF file-33488-1-10-20200910.pdf
Size
435.08 KB
Format
Adobe PDF