1. Ajtai, M., Erdös, P., Komlós, J., Szemerédi, E.: On Turan’s theorem for sparse graphs. Combinatorica 1, 313–317 (1981)
2. Alon, N.: Independence numbers of locally sparse graphs and a Ramsey type problem. Random Structures and Algorithms 9, 271–278 (1996)
3. Alon, N., Kahale, N.: Approximating the independence number via the θ-function. Math. Programming 80, 253–264 (1998)
4. Alon, N., Wormald, N.: High degree graphs contain large-star factors. In: Katona, G., Schrijver, A., Szönyi, T. (eds.) Fete of Combinatorics, Bolyai Soc. Math. Studies 20, pp. 9–21. Springer, Heidelberg (2010)
5. Austrin, P., Khot, S., Safra, M.: Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. In: IEEE Conference on Computational Complexity 2009, pp. 74–80 (2009)