ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K[ai,bi]K[a_i,b_i] denote the complete bib_i-partite graph with aia_i vertices in each part, and let GG be its direct product

G=∏i=1tK[ai,bi].G= \prod_{i=1}^t K[a_i,b_i].

Assume 2≤b1≤b2≤⋯≤bt2\leq b_1\leq b_2\leq\cdots\leq b_t. The upper domination conjecture.

Γ(G)=1b1∏i=1taibi.\Gamma(G)=\frac{1}{b_1}\prod_{i=1}^t a_i b_i.

Here Γ(G)\Gamma(G) is the maximum size of a minimal dominating set of GG. The proposition preceding the conjecture proves the corresponding lower bound, and the equality is known when t≤3t\leq 3 but remains open in general. A particularly attractive unresolved special case is G=∏i=1tK3G=\prod_{i=1}^t K_3.

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.