ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α(k,r)\alpha(k,r) be the parameter defined as the minimum number of edges between a specified independent transversal and its complement over all KrK_r-partite-saturated kk-partite graphs, with k≥r≥3k\ge r\ge 3. The conjecture for α(k,r)\alpha(k,r). For

5≤r≤k≤2r−4,5\le r\le k\le 2r-4,

one has

α(k,r)=(k−1)(4r−k−6).\alpha(k,r)=(k-1)(4r-k-6).

The authors present this as the expected correct value of the upper bound in this range; the supplied text does not establish it.

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.