Summary from listing
TU Delft is hiring a full-time PhD candidate in combinatorics within its Discrete Mathematics and Optimization group. The research focuses on probabilistic and extremal combinatorics, structural graph theory, and algorithms, with potential topics including universal graphs, reconstruction problems, and faster graph-coloring algorithms. The candidate will be supervised by Carla Groenland, collaborate with other researchers, publish scientific work, participate in seminars and conferences, and perform minor teaching tasks of at most 15%. The position requires a master's degree in mathematics or a closely related discipline, prior research experience, strong communication and collaboration skills, and fluent English. The employment is structured as two contracts totaling four years, with salary and benefits governed by the Collective Labour Agreement for Dutch Universities.
