Edge colouring with delays

Noga Alon*, Vera Asodi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Consider the following communication problem, which leads to a new notion of edge colouring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers. The edges correspond to messages, and every edge e is associated with an integer c(e), corresponding to the time it takes the message to reach its destination. A proper k-edge-colouring with delays is a function f from the edges to {0,1,..., k - 1}, such that, for every two edges e1 and e2 with the same transmitter, f(e1) ≠ f(e2), and for every two edges e1 and e2 with the same receiver, f(e1) + c(e1) ≢ + f(e 2) + c(e2) (mod k). Ross, Bambos, Kumaran, Saniee and Widjaja [18] conjectured that there always exists a proper edge colouring with delays using k = Δ + o(Δ) colours, where Δ is the maximum degree of the graph. Haxell, Wilfong and Winkler [11] conjectured that a stronger result holds: k = Δ + 1 colours always suffice. We prove the weaker conjecture for simple bipartite graphs, using a probabilistic approach, and further show that the stronger conjecture holds for some multigraphs, applying algebraic tools.

Original languageEnglish
Pages (from-to)173-191
Number of pages19
JournalCombinatorics Probability and Computing
Issue number2
StatePublished - Mar 2007


FundersFunder number
Hermann Minkowski Minerva Center for Geometry
Bloom's Syndrome Foundation
Israel Science Foundation
Tel Aviv University


    Dive into the research topics of 'Edge colouring with delays'. Together they form a unique fingerprint.

    Cite this