Unimodality conjecture for dominating-set sequences of finite graphs
Statement
Let be a finite undirected graph on vertices. A dominating set is a set of vertices such that every vertex is either in the set or adjacent to a vertex in the set. For , let be the number of dominating sets of with cardinality . Unimodality conjecture. The sequence is unimodal: there exists some such that
The conjecture concerns the shape of dominating-set enumerators, while this paper gives examples showing that dominating-set sequences need not be log-concave. Since log-concavity implies unimodality under the relevant endpoint conditions, disproving log-concavity does not by itself disprove this conjecture; the supplied text gives no resolution status for the unimodality claim.
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.