ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Spn^\hat{S_p^n} be the generalized Sierpiński triangle graph with integers n≥3n\geq 3 and p≥4p\geq 4, and let f(G)f(G) denote the feedback vertex number of a graph GG, namely the minimum number of vertices whose deletion makes GG acyclic. Feedback vertex number conjecture.

f(Spn^)={pn−pn−18+pn−2+⋯+p8+5p8,if p is even,pn−pn−1+pn−2−5p+38,if p is odd.f(\hat{S_p^n})=\left\{\begin{array}{ll}p^n-\frac{p^{n-1}}{8}+\frac{p^{n-2}+\cdots+p}{8}+\frac{5p}{8}, & \text{if }p\text{ is even},\\ p^n-\frac{p^{n-1}+p^{n-2}-5p+3}{8}, & \text{if }p\text{ is odd}. \end{array}\right.

The preceding result gives an upper bound for f(Spn^)f(\hat{S_p^n}) by constructing an induced forest, and the authors suspect that this bound is exact for all n≥3n\geq 3 and p≥4p\geq 4.

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.