ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. Write f‾(G)\underline{f}(G) for the minimum fort size of GG, let MObs(G;i)\mathrm{MObs}(G;i) denote the marginal observance at step ii, and let γP(G)\gamma_P(G) denote the power domination number. For a positive integer kk, write [k]={1,…,k}[k]=\{1,\ldots,k\}. Minimum-fort-size conjecture. If

f‾(G)≥4,\underline{f}(G)\geq 4,

then

MObs(G;i)≥4\mathrm{MObs}(G;i)\geq 4

for all i∈[γP(G)]i\in[\gamma_P(G)]. This asks whether the relationship between minimum fort size and marginal observances established for smaller minimum fort sizes extends to minimum fort size at least four; its status is not resolved in the source.

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.