On chooser-picker positional games

DOI10.1016/j.disc.2009.03.051zbMath1177.91050OpenAlexW2026387034MaRDI QIDQ1044991

C. Ivett Mándity, András Csernenszky, András Pluhár

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.051

zbMATH Keywords

hypergraphBeck's conjecturepositional gamepicker-chooser game

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (8)

Picker-chooser fixed graph games ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ Maker-breaker total domination game ⋮ Fast strategies in Waiter-Client games ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ Client-waiter games on complete and random graphs ⋮ The picker-chooser diameter game ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Van der Waerden and Ramsey type games
• On the complexity of some two-person perfect-information games
• Positional games and the second moment method
• On the Complexity of Chooser–Picker Positional Games
• The diameter game
• Remarks on positional games. I
• Regularity and Positional Games
• Deterministic Graph Games and a Probabilistic Intuition
• A Solution of the Shannon Switching Game
• Positional Games
• On a combinatorial game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: On chooser-picker positional games