Surprising identities for the greedy independent set on Cayley trees

From MaRDI portal
Publication:5049896




Abstract: We prove a surprising symmetry between the law of the size Gn of the greedy independent set on a uniform Cayley tree mathcalTn of size n and that of its complement. We show that Gn has the same law as the number of vertices at even height in mathcalTn rooted at a uniform vertex. This enables us to compute the exact law of the Gn. We also give a Markovian construction of the greedy independent set, which highlights the symmetry of Gn and whose proof uses a new Markovian exploration of rooted Cayley trees which is of independent interest.









This page was built for publication: Surprising identities for the greedy independent set on Cayley trees

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