®®®® SIIA Público

Título del libro: Combinatorics, Complexity, And Chance: A Tribute To Dominic Welsh
Título del capítulo: Advances on the Erdos-Faber-Lovász Conjecture

Autores UNAM:
DAVID RENE ROMERO CAMARENA;
Autores externos:

Idioma:
Inglés
Año de publicación:
2007
Palabras clave:

Conjectures; Erd?s; Faber; Hypergraph; Lovász


Resumen:

A hypergraph is linear if no two distinct edges intersect in more than one vertex. A well-known conjecture of Erd?s, Faber, and Lovász states that if a linear hypergraph has n edges, each of size n, then there is a n-vertex colouring of the hypergraph such that each edge contains one vertex of each colour. Dating back to 1972, it is very surprising that this conjecture has not been settled in its full generality. This chapter presents some advances on it. © Oxford University Press, 2013.


Entidades citadas de la UNAM: