Exact feedback vertex number of generalized Sierpiński triangle graphs
Statement
Let be the generalized Sierpiński triangle graph with integers and , and let denote the feedback vertex number of a graph , namely the minimum number of vertices whose deletion makes acyclic. Feedback vertex number conjecture.
The preceding result gives an upper bound for by constructing an induced forest, and the authors suspect that this bound is exact for all and .
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.