Alon–Saks–Seymour conjecture for clause-sets
Statement
Let be a clause-set with at most one conflict between any two clauses. Write for its deficiency and for its colouring deficiency, where is the number of clauses, is the associated conflict graph, and denotes chromatic number.
Alon–Saks–Seymour conjecture. For every such clause-set ,
The source presents this as a reformulation of the Alon–Saks–Seymour conjecture that a graph expressible as a union of edge-disjoint complete bipartite graphs has chromatic number at most . No resolution is supplied.
Record
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.