Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/20566
Title: | Fast strategies in waiter-client games | Authors: | Clemens Dennis Gupta Pranshu Hamann Fabian Haupt Alexander Mikalački, Mirjana Mogge Yannick |
Issue Date: | 2020 | Journal: | Electronic Journal of Combinatorics | Abstract: | © The authors. Waiter-Client games are played on some hypergraph (X, F), where F denotes the family of winning sets. For some bias b, during each round of the game Waiter offers b + 1 elements of X to Client from which he claims one for himself and 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 F. 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. | URI: | https://open.uns.ac.rs/handle/123456789/20566 | ISSN: | 1077-8926 | DOI: | 10.37236/9451 (BISIS)115771 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
2
checked on Mar 15, 2024
Page view(s)
14
Last Week
11
11
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.