Special events
Friday February 14, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Wednesday February 12, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Wednesday February 12, 2020, 2PM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Monday February 10, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Friday February 7, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Wednesday February 5, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Wednesday February 5, 2020, 2PM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Monday February 3, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Friday January 31, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Wednesday January 29, 2020, 10:30AM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion

Special events
Wednesday January 29, 2020, 2PM, 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:

  1. How complex is a graph?
  2. First-order Logic
  3. Transductions
  4. Sparsity I: Measuring shallow minors
  5. Sparsity II: Low tree-depth decompositions
  6. Sparsity III: Generalized colouring numbers
  7. Sparsity IV: Uniform quasi-wideness
  8. Graph theory and Logic
  9. Limits of graphs I: Classical limits
  10. Limits of graphs II: Structural limits
  11. Conclusion, Problems, and Discussion