Stars on trees

From MaRDI portal
Publication:512591




Abstract: For a positive integer r and a vertex v of a graph G, let mathcalIG(r)(v) denote the set of all independent sets of G that have exactly r elements and contain v. Hurlbert and Kamat conjectured that for any r and any tree T, there exists a leaf z of T such that |mathcalIT(r)(v)|leq|mathcalIT(r)(z)| for each vertex v of T. They proved the conjecture for rleq4. For any kgeq3, we construct a tree Tk that has a vertex x such that x is not a leaf of Tk, |mathcalITk(r)(z)|<|mathcalITk(r)(x)| for any leaf z of Tk and any 5leqrleq2k+1, and 2k+1 is the largest integer s for which mathcalITk(s)(x) is non-empty. Therefore, the conjecture is not true for rgeq5.









This page was built for publication: Stars on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512591)