Location
Dates
Presentation
Graph Theory lies on the interface between combinatorics and discrete mathematics. The domain has expanded considerably over the last decades with interactions invarious fields such as the study of social networks, algorithms, computer science, interprobabilities, discrete geometry, producing some spectacular results.
There will be 5 mini courses of 6 hours each and 2 mini courses of 3 hours each. The courses will first introduce basic tools and the, move on to more advanced concepts in graph theory such as algorithms and their applications to computer sciences, combinatorial optimization related to linear programming, scale-free graphs, spectral theory, the theory of infinite graphs. Applications will include models of the internet, social networks, small world phenomena, also discrete geometry and probability theory.
Official language of the school: English
Administrative and scientific coordinators
Scientific program
Course 1: "Scale-Free Graphs and the Preferential Attachement Scheme", Paul Baird (Université de Brest, France)
Course 2: "Graphs and Polyhedral Optimization", Fatiha Bendali (École Polytechnique, France)
Course 3: "Polygon Hulls of Euclidean Graphs", Ahcène Bounceur (Université de Brest, France)
Course 4: "Infinite Graph Theory", Mirna Dzamonia (University of East Anglia, UK)
Course 5: "Maximal Forests", Amine El Sahili (Lebanese University, Lebanon)
Course 6: "Isoperimetrics Inequalities on Graphs", Ali Fardoun (Université Brest, France)
Course 7: "Probabilistic Methods", Maydoun Mortada (University of Lebanon, Lebanon)
Course 8: "Curvature of Graphs Using Optimal Transportation", Pascal Romon (Université Paris-Est-Marne-la-Vallée, France)
Website of the school
How to participate
For registration and application to a CIMPA financial support, follow the instructions given here.
Deadline for registration and application: March 10, 2022