ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a finite simple graph. For disjoint nonempty sets L,R⊆VL,R\subseteq V such that {u,v}∈E\{u,v\}\in E for all u∈Lu\in L and v∈Rv\in R, write B(L,R)={{u,v}:u∈L, v∈R}B(L,R)=\{\{u,v\}: u\in L,\ v\in R\} for the edge set of the corresponding complete bipartite subgraph of GG. Call bp(G)bp(G) the least kk for which there exist such pairs (L1,R1),…,(Lk,Rk)(L_1,R_1),\dots,(L_k,R_k) with

E=⨆i=1kB(Li,Ri),E=\bigsqcup_{i=1}^{k} B(L_i,R_i),

that is, the sets B(L1,R1),…,B(Lk,Rk)B(L_1,R_1),\dots,B(L_k,R_k) are pairwise disjoint and their union is EE. Let χ(G)\chi(G) denote the chromatic number of GG.

Then for every finite simple graph GG,

χ(G)≤bp(G)+1,\chi(G)\le bp(G)+1,

equivalently, if χ(G)=k+1\chi(G)=k+1 then every partition of EE into edge sets of complete bipartite subgraphs of GG uses at least kk parts.

Record

Added
Links

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.