-
: extremal graph theory, Ramsey theory, probabilistic combinatorics. • Candidates should have (or be near completion of) a PhD in mathematics. • Candidates should have a strong research record in Combinatorics
-
curriculum vitae of each nominee (if available, mandatory for self-nominations Please note that any further documents or appendices (like tables, graphs, etc.) will not be considered in the evaluation
Searches related to graph
Enter an email to receive alerts for graph positions in Switzerland