Generalized Alon–Saks–Seymour conjecture of order t
Statement
Let be a graph and a positive integer. A -biclique covering is a collection of complete bipartite graphs covering every edge of at least once and at most times; let be the minimum size of such a covering. Let be the chromatic number. Generalized Alon–Saks–Seymour conjecture of order . There exists a polynomial such that for every graph ,
The parameter generalizes ordinary bipartite packing, since . The source poses this as a natural question and gives no resolution in the supplied text.
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.