Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs

Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one as the size of the graph tends to infinity.

• Type: Conference
• Year: 2007
• Where: MFCS
• Authors: William Duckworth, Michele Zito
• Keywords: Algorithmic Lower Bounds, MFCS 2007, Random D-regular Graph