ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected subcubic planar graph, and for i∈{0,1,2,3}i\in\{0,1,2,3\} let ni(G)n_i(G) denote the number of vertices of degree ii in GG. Let γ(G)\gamma(G) denote the domination number of GG. The conjectured optimal bound. There exists a constant NN such that every such graph with at least NN vertices satisfies

γ(G)≤n0(G)+1320n1(G)+12n2(G)+720n3(G).\gamma(G) \leq n_0(G) + \frac{13}{20} n_1(G) + \frac{1}{2} n_2(G) + \frac{7}{20} n_3(G).

The conjecture is motivated by a constructed family showing that the coefficient 12\frac{1}{2} on n2(G)n_2(G) would make the paper's upper bound tight. The source gives no 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.