Theory of Combinatorial Games in Graphs
Series: Springer Undergraduate Texts in Mathematics and Technology;
- Publisher's listprice EUR 64.19
-
25 072 Ft (23 878 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 5 014 Ft off)
- Discounted price 20 058 Ft (19 102 Ft + 5% VAT)
- Discount is valid until: 30 June 2026
Subcribe now and take benefit of a favourable price.
Subscribe
22 063 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Editora do IMPA
- Date of Publication 25 July 2026
- ISBN 9783032268655
- Binding Hardback
- No. of pages267 pages
- Size 254x178 mm
- Language English
- Illustrations IX, 267 p. 700
Categories
Long description:
This book offers a comprehensive introduction to the field of combinatorial games, with a contemporary focus on games played on graphs. It provides a clear, structured tour of the major classes of combinatorial games (normal, mise?re, impartial, partizan, and positional), illustrated throughout with graph?based examples.
The book is divided into three parts. Part I presents the fundamental theoretical foundations of combinatorial game theory. Part II explores their applications to recently studied games on graphs, and Part III provides a summary of the theory of partizan games in the normal variant. Readers will find coverage of the Sprague?Grundy theory for impartial games, extremal combinatorics in game settings, computational complexity of games, convexity games on graphs, domination games, cops?and?robber games, as well as Conway?s theory of partizan games and surreal numbers. Beyond its introductory material, the book also brings together several active research topics that are typically scattered across the literature, such as graph coloring games, graph convexity games, and connectivity games.
Although primarily designed for undergraduate students, the book?s more advanced results will also be valuable to graduate students and researchers working in the area.
MoreTable of Contents:
Introduction to combinatorial games.- Sprague-Grundy theory of impartial games.- Extremal combinatorics for games.- Positional games.- Computational complexity of games.- Convexity games in graphs.- Coloring games in graphs.- Domination games in graphs.- Cops and robber games on graphs.- Conway's theory of partizan games.- Appendix.
More
