ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a clause-set with at most one conflict between any two clauses. Write δ(F) \delta(F) for its deficiency and δχ(F):=c(F)−χ(cg⁡(F)) \delta_{\chi}(F):=c(F)-\chi(\operatorname{cg}(F)) for its colouring deficiency, where c(F)c(F) is the number of clauses, cg⁡(F) \operatorname{cg}(F) is the associated conflict graph, and χ \chi denotes chromatic number.

Alon–Saks–Seymour conjecture. For every such clause-set FF,

δ(F)≤δχ(F)+1.\delta(F)\leq\delta_{\chi}(F)+1.

The source presents this as a reformulation of the Alon–Saks–Seymour conjecture that a graph expressible as a union of mm edge-disjoint complete bipartite graphs has chromatic number at most m+1m+1. 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 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.