Weighted bipartite edge colouring
Statement
Let G=(S,T;E) be a bipartite graph, with weights . A proper weighted edge colouring is a colouring of the edges such that at each vertex, the sum of weights of edges of the same colour is at most 1. A lower bound for the number of colours is the minimum number of unit bins needed to pack the weights incident to any vertex, denoted by b. Is there always a proper weighted edge colouring using colours?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.