Évènement spécial Vendredi 14 février 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low complexity networks: A model theoretical approach to sparsity, Part 11/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Mercredi 12 février 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low complexity networks: A model theoretical approach to sparsity, Part 9/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Mercredi 12 février 2020, 14 heures, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low complexity networks: A model theoretical approach to sparsity, Part 10/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Lundi 10 février 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low complexity networks: A model theoretical approach to sparsity, Part 8/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Vendredi 7 février 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESSS) Low complexity networks: A model theoretical approach to sparsity, Part 7/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Mercredi 5 février 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESSS) Low complexity networks: A model theoretical approach to sparsity, Part 5/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Mercredi 5 février 2020, 14 heures, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESSS) Low complexity networks: A model theoretical approach to sparsity, Part 6/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Lundi 3 février 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low complexity networks: A model theoretical approach to sparsity, Part 4/11 Duration: two hours The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Vendredi 31 janvier 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low complexity networks: A model theoretical approach to sparsity, Part 3/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Mercredi 29 janvier 2020, 10 heures 30, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESS) Low Complexity networks: A model theoretical approach to sparsity, Part 1/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion Évènement spécial Mercredi 29 janvier 2020, 14 heures, 3052 Patrice Ossona De Mendez (CAMS, CNRS/EHESSS) Low complexity networks: A model theoretical approach to sparsity, Part 2/11 Duration: two hours. The plan of the course is: How complex is a graph? First-order Logic Transductions Sparsity I: Measuring shallow minors Sparsity II: Low tree-depth decompositions Sparsity III: Generalized colouring numbers Sparsity IV: Uniform quasi-wideness Graph theory and Logic Limits of graphs I: Classical limits Limits of graphs II: Structural limits Conclusion, Problems, and Discussion