Asymptotic n/6 domination conjecture for degree-six triangulations
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 such that every -vertex triangulation with maximum degree has a dominating set of size at most
The paper presents this as a possible sharp strengthening of its proved 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.