ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bipartite graph. For κ0≥5 \kappa_0\geq 5, let Hκ0,κ0H_{\kappa_0,\kappa_0} be a largest induced crown graph in GG, and let R(G) \mathcal{R}(G) denote the representation number of GG.

Crown-subgraph conjecture. The representation number of GG equals either

⌈κ02⌉\left\lceil\frac{\kappa_0}{2}\right\rceil

or

⌈1+κ02⌉.\left\lceil\frac{1+\kappa_0}{2}\right\rceil.

This conjecture proposes that the representation number is determined, up to the two displayed possibilities, by the largest induced crown graph in GG. The source presents it in the conclusion and gives no evidence of a resolution.

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.