Thesis topic proposal
András Pluhár
Combinatorial games


Institute: University of Szeged
computer sciences
PhD School in Computer Science

Thesis supervisor: András Pluhár
Location of studies: SZTE
Abbreviation of location of studies: SZTE

Description of the research topic:

Combinatorial games are an important branch of both of mathematics and computer science. One of its basic method is the use of weight funtions and the derandomizatio of algorithms. In the recent years there was a huge progress in the theory of biased and accelerated games, and one can expect the continuation of this trend. The main field of research is the graph games. Some of those: variations of degree games, and diameter games, achievement of pseudo-random graphs etc. A relatively new and promising area is the so-called Choser-Picker games; namely to find clases for which Beck's conjecture holds. Within this the computer aided solution of classical games is intriguing (variants of k-in-a-row, Hales-Jewett games, torus games etc) in the original Maker-Breaker and in the Choser-Picker sense.

Further requirements: 
Research topic for foreign applicants.

Number of students who can be accepted: 1

Deadline for application: 2017-03-31

All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 1.2318 ( 2016. XI. 26. )