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. The degree of a vertex is its number of incident edges. The bounded-exception domination conjecture. For every constant tt, there exists an integer ntn_t such that every nn-vertex triangulation with at most tt vertices whose degree is not 66, and with n≥ntn\geq n_t, has a dominating set of size at most n/4n/4. This extends the paper's maximum-degree-six result to triangulations that are degree six except at a bounded number of vertices; the supplied text does not resolve it.

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.