NEW NOTIONS OF RANK AND INDEPENDENCE FOR FINITE GRAPHS

FC1-M027 (edificio do Dep. Matemática)
Friday, 4 May, 2012 - 08:30

Last year, Izakhian and Rhodes developed a theory of representation of matroids by boolean matrices where all matroids become representable, unlike the case of classical representations over fields. In a joint work with Rhodes, we explore a similar approach in the context of finite graphs, leading to new notions of rank and independence of vertices and establishing new connections to matroid theory.

Speaker: 

Pedro V. Silva (Univ. Porto/CMUP)
Error | CMUP

Error

The website encountered an unexpected error. Please try again later.