A variety of different combinatorial concepts have been chosen as topics of the school. The school will provide an introduction to both basic and more advanced topics. It will be aimed mostly at Masters level students and will thus assume a reasonable general mathematical background but no previous specialized knowledge in the topics covered in the courses. The scientific content of the various courses will be tightly coordinated in order to provide the students with the possibility of a real concrete learning experience which can become the foundation for further study. The material will be motivated by an overview of the field and discussion of main open problems but will consist mainly of relatively simple cases through which the students can learn specific techniques of proof. Significant amount of time will be dedicated to exercise and tutorial sessions where students will receive individual attention from the lecturers. The first week of the school will consist of four introductory courses covering the colorings and labeling of graphs, F‐convexity and related problems, Cayley graphs, the degree‐diameter problem and the metric dimension related parameters in graphs. The second week will be more advanced and include courses on the Tropical convexity, combinatorics, and commutative algebra, Metric spaces over groups, Neumaier, Signed and Addressing Graphs. In the last course we will discuss new bound for strongly regular graphs, Recent progress on Neumaier graphs and Open problems in signed and addressing graphs.
| Colourings and Labelings of Graphs | Andrea Semaničová-Feňovčíková (Technical University in Košice, Slovakia) |
| On F-convexity and Related Problems | Liping Yuan (Hebei Normal University,China) |
| Cayley Graphs and the Degree-Diameter Problem | Tomas Vetrik (University of the Free State, South Africa) |
| Metric Dimension Related Parameters in Graphs | Yero Ismael Gonzalez (Universidad de Cádiz, South Africa) |
| On Neumaier, Signed and Adressing Graphs | Jack Koolen (University of Science and Technology of China, China) |
| Computational Workshop: Graph Based Codes with SAGEMath | Edgar Martínez-Moro (University of Valladolid, Castilla, Spain) |
| Matrices, Graph Labelings, and Ramsey Numbers | Rinovia Simanjuntak (Institut Teknologi Bandung, Indonesia) |
| Spectrum Related Invariants of Graphs | Muhammad Imran (U. A. E) |