On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468)

The theme of this paper is the 1-2-3 conjecture, and some variations of it, in specific classes of graphs and hypergraphs. The 1-2-3 conjecture is about the smallest natural number \(k\) such that we can label the edges of a graph that does not contain an edge component with numbers from \(\{1,\ldots, k\}\) so that the sum of the labels over the edge \(s\) incident to each vertex yields a proper vertex colouring. With \(\chi^{\mathrm{e}}(G)\) denoting this number, the 1-2-3 conjecture states that this number is at most 3. The paper considers \(\chi^{\mathrm{e}}\) as well as \(\chi^{\mathrm{ve}}\) and \(\chi^{\mathrm{ven}}\). In the latter variations, the vertices of the graph receive labels too. The parameter \(\chi^{\mathrm{ve}}\) is the smallest \(k\) such that if we label the edges and the vertices of a graph \(G\) with labels from \(\{1,\ldots, k\}\), then the sum of the labels of the edges incident to a vertex together with the label of that vertex yields a proper colouring of \(G\). The parameter \(\chi^{\mathrm{ven}}\) is the smallest \(k\) such that the sum of the labels of the edges incident to a vertex together with the label of that vertex and the vertices in its neighbourhood yields a proper colouring of \(G\). It is conjectured that these parameters are also at most 3, if \(G\) contains no edge component (and for all graphs in the case of \(\chi^\mathrm{ve}\)). The 1-2-3 conjecture has been generalised for \(r\)-uniform hypergraphs, for \(r\geq 3\). The paper determines (exactly) \(\chi^{\mathrm{e}}\), \(\chi^{\mathrm{ven}}\) for certain classes of graphs. It also gives the value of \(\chi^\mathrm{e}\) for the complete \(r\)-uniform \(n\)-partite hypergraph, provided that \(n\) is sufficiently large in terms of \(r\), showing that it is equal to 2. The same is deduced for \(\chi^{\mathrm{ve}}\) and \(\chi^{\mathrm{ven}}\). Furthermore, \(r\)-uniform \(t\)-tight paths and cycles are considered, where \(\chi^\mathrm{e}\) is shown to be either 2 or 1, depending on certain relations between \(t\), \(r\) and the length of the path (or the cycle, respectively).