# A note on asymptotically optimal neighbour sum distinguishing colourings

## TL;DR

This paper improves the upper bound on the minimum number of colours needed for neighbour sum distinguishing edge colourings in graphs, showing it is at most  + O(\u00D7^{1/2}) using a combinatorial and probabilistic approach.

## Contribution

It provides a tighter upper bound  + O(^{1/2}) for neighbour sum distinguishing colourings, simplifying previous methods with a combinatorial and probabilistic approach.

## Key findings

- Improved upper bound to  + O(^{1/2}) for neighbour sum distinguishing edge colourings.
- Extended the same bound to the total version of the problem.
- Simplified the proof technique using combinatorial algorithms and probabilistic methods.

## Abstract

The least $k$ admitting a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ of a graph $G=(V,E)$ without isolated edges such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every $uv\in E$ is denoted by $\chi'_{\Sigma}(G)$. It has been conjectured that $\chi'_{\Sigma}(G)\leq \Delta + 2$ for every connected graph of order at least three different from the cycle $C_5$, where $\Delta$ is the maximum degree of $G$. It is known that $\chi'_{\Sigma}(G) = \Delta + O(\Delta^\frac{5}{6}\ln^\frac{1}{6}\Delta)$ for a graph $G$ without isolated edges. We improve this upper bound to $\chi'_{\Sigma}(G) = \Delta + O(\Delta^\frac{1}{2})$ using a simpler approach involving a combinatorial algorithm enhanced by the probabilistic method. The same upper bound is provided for the total version of this problem as well.