On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2020

On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs

Résumé

A well-known conjecture of Erdős, Faber and Lovász can be stated in the following way: every loopless linear hypergraph H on n vertices can be n-edge-colored, or equivalently q(H) ≤ n, where q(H) is the chromatic index of H , i.e. the smallest number of colors such that intersecting hyperedges of H are colored with distinct colors. In this article we prove this assertion for Helly hypergraphs, for weakly trianguled hypergraphs, for well ordered hypergraphs and for a certain family of uniform hypergraphs.
Fichier principal
Vignette du fichier
S0012365X20302454.pdf (214.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02933032 , version 1 (22-08-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Alain Bretto, Alain Faisant, François Hennecart. On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs. Discrete Mathematics, 2020, 343, ⟨10.1016/j.disc.2020.112059⟩. ⟨hal-02933032⟩
56 Consultations
23 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More