Wang et al.’s conjecture on maximal dissociation sets in trees
Statement
Let be a tree of order . A set is a dissociation set if every vertex of the induced subgraph has degree at most , and it is maximal if it is inclusion-maximal among dissociation sets. Let denote the number of maximal dissociation sets of . The conjecture asks whether
where
g(n)=\begin{cases} n,&n=3,4,5,6,\\ 3^{\frac{n-1}{3}}+\frac{n-1}{3},&n\equiv 1\pmod 3,\ n\geq 7,\\ 4\cdot 3^{\frac{n-5}{3}}+n-5,&n\equiv 2\pmod 3,\ n\geq 8,\\ 16\cdot 3^{\frac{n-9}{3}}+3n-25,&n\equiv 0\pmod 3,\ n\geq 12,\ n\neq 21,\\ 19,&n=9,\\ 1349,&n=21. \end{cases} \] The associated extremal problem also asks for a characterization of all trees attaining this maximum.Record
- Added
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.