A hypergraph H is linear if no two distinct edges of H intersect in more than one vertex and loopless if no edge has size one. A q-edge-colouring of H is a colouring of the edges of H with q colours such that intersecting edges receive different colours. We use ∆ H to denote the maximum degree of H. A well known conjecture of Erdös, Farber and Lovász is equivalent to the statement that every loopless linear hypergraph on n vertices can be n-edge-coloured. In this note we show that the conjecture is true when the partial hypergraph S of H determined by the edges of size at least three can be ∆ S -edge-coloured and satisfies ∆ S ≤ 3. In particular, the conjecture holds when S is unimodular and ∆ S ≤ 3.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.