~~NOCACHE~~
/* DO NOT EDIT THIS FILE             */

[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3923">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3923" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3924">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3924" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3925">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3925" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3926">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3926" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3927">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3927" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3928">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3928" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3929">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3929" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3930">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3930" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3931">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3931" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3932">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3932" collapsed="true">
<well size="sm">
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
</well>
</collapse>


[[en:seminaires:hors-series:index|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//
<button type="link" size="xs" collapse="b24-3933">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b24-3933" collapsed="true">
<well size="sm">
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
</well>
</collapse>