Alon–Saks–Seymour conjecture
Statement
Let be a finite simple graph. For disjoint nonempty sets such that for all and , write for the edge set of the corresponding complete bipartite subgraph of . Call the least for which there exist such pairs with
that is, the sets are pairwise disjoint and their union is . Let denote the chromatic number of .
Then for every finite simple graph ,
equivalently, if then every partition of into edge sets of complete bipartite subgraphs of uses at least parts.
Record
- 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.