Faber, V. and Harris, D. (2019) Edge-Coloring Linear Hypergraphs with Medium- Sized Edges. Random Structures & Algorithms, 55, 153-159.
https://doi.org/10.1002/rsa.20843

has been cited by the following article:

• TITLE: The Erdös-Faber-Lovász Conjecture for Gap-Restricted Hypergraphs

  AUTHORS: Zhimin Wang

  KEYWORDS: Linear Hypergraph, Chromatic Index, Erdös-Faber-Lovász Conjecture, Edge Cardinality

  JOURNAL NAME: Engineering, Vol.16 No.2, February 29, 2024

  ABSTRACT: An edge coloring of hypergraph H is a function such thatholds for any pair of intersecting edges . The minimum number of colors in edge colorings of H is called the chromatic index of H and is denoted by . Erdös, Faber and Lovász proposed a famous conjecture thatholds for any loopless linear hypergraph H with n vertices. In this paper, we show thatis true for gap-restricted hypergraphs. Our result extends a result of Alesandroni in 2021.