Abstract
We present algorithmic lower bounds on the size sd of the largest independent sets of vertices in random d-regular graphs, for each fixed d > 3. For instance, for d = 3 we prove that, for graphs on n vertices, sd > 0.43475n with probability approaching one as n tends to infinity. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Duckworth, W., & Zito, M. (2007). Uncover low degree vertices and minimise the mess: Independent sets in random regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 56–66). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
