ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree of order n≥3n\geq 3. A set S⊆V(T)S\subseteq V(T) is a dissociation set if every vertex of the induced subgraph T[S]T[S] has degree at most 11, and it is maximal if it is inclusion-maximal among dissociation sets. Let Φ(T)\Phi(T) denote the number of maximal dissociation sets of TT. The conjecture asks whether

max⁡∣V(T)∣=nΦ(T)=g(n),\max_{\lvert V(T)\rvert=n}\Phi(T)=g(n),

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
Links

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.