Mardi 9 Décembre
Heure: 
12:30  13:30 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Complexity aspects of graph convexities 
Description: 
Mitre Dourado In the first half of the talk, I will survey the basic concepts, problems and main known results related to computational complexity aspects of graph convexities. In the second half, I will present some new results on the Radon number in the geodetic convexity, among them a polynomial time algorithm for finding the Radon number of unit interval graphs.
This is a joint work with: Jayme Luiz Szwarcfiter Alexandre Toman 
Heure: 
14:00  17:00 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Asymptotic expansion for random tensor models 
Description: 
Adrian Tanasa Threedimensional random tensor models are a natural generalization ofthe celebrated matrix models. The associated tensor graphs, or 3Dmaps, can be classified with respect to a particular integer orhalfinteger, the degree of the respective graph.I will present in this talk a combinatorial analysis of the generalterm of the asymptotic expansion in N, the size of the tensor, of aparticular random tensor model, the socalled multiorientable model.I will then present some enumerative results and show which are thedominant configurations of a given degree; several examples will alsobe given. 

