ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A triangulation is a plane graph in which every face, including the outer face, is bounded by a triangle. A dominating set of a graph is a set containing every vertex or a neighbor of every vertex. The n/6 domination conjecture. There exists a constant cc such that every nn-vertex triangulation with maximum degree 66 has a dominating set of size at most

n/6+c.n/6+c.

The paper presents this as a possible sharp strengthening of its proved n/4n/4 bound for maximum-degree-six triangulations; its truth is not established in the supplied text.

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.