ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and tt a positive integer. A tt-biclique covering is a collection of complete bipartite graphs covering every edge of GG at least once and at most tt times; let bpt(G)\mathbf{bp}_t(G) be the minimum size of such a covering. Let χ(G)\chi(G) be the chromatic number. Generalized Alon–Saks–Seymour conjecture of order tt. There exists a polynomial PtP_t such that for every graph GG,

χ(G)≤Pt(bpt(G)).\chi(G)\leq P_t(\mathbf{bp}_t(G)).

The parameter generalizes ordinary bipartite packing, since bp1(G)=bp(G)\mathbf{bp}_1(G)=\mathbf{bp}(G). 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 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.