Departament de Matemàtiques

Comparteix:

Esdeveniments del dia Dijous, 19. Maig 2016

Esdeveniments del lloc

  • 2016-04-05T00:00:00+02:00
  • 2016-12-16T23:59:59+01:00
Abril

5

Dimarts

05/04/2016 fins a 16/12/2016

We would like to remind you about the forthcoming CRM Intensive Research Program on Large Cardinals and Strong Logics, to be held from September 5 to December 16, 2016. The National Science Foundation and the Association for Symbolic Logic offer grants to participate in the program and its scientific events.

  • 2016-05-19T13:15:00+02:00
  • 2016-05-19T14:15:00+02:00
  • Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)
Maig

19

Dijous

19/05/2016 de 13:15 a 14:15

Title: Rainbow matchings in $r$-partite graph structures Speaker: Pilar Cano Universitat Politècnica de Catalunya and Carleton University (Canadá) Thursday, May 19, 2016, 13:15-14:15 Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)

  • 2016-05-19T13:15:00+02:00
  • 2016-05-19T14:15:00+02:00
  • Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)
Maig

19

Dijous

19/05/2016 de 13:15 a 14:15

Speaker: Pilar Cano - Universitat Politècnica de Catalunya and Carleton University A rainbow matching in an edge colored hypergraph is a matching such that each pair of its edges have distinct colors. Brualdi, Ryser and Stein conjectured the existence of a partial n-1 Latin transversal in a Latin square n-matrix. This problem can be translated into finding a rainbow matching in a complete bipartite graph. We extend the result of Erds and Spencer on the existence of rainbow matchings in the complete bipartite graph {n,n} to complete r-partite r-uniform graphs, complete bipartite graphs with repeated edges, and d-regular bipartite graphs minus a matching. The results use the Lopsided version of the Local Lovász Lemma.