ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(S,T;E) be a bipartite graph, with weights w:E→[0,1]w:E \to [0,1]. 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 2b−12b-1 colours?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.