Wikipedia:Articles for deletion/Arthur Rubin (2nd nomination)
There's a possible pass of  #5 (known for originating an important new concept) from his 1979 paper with Erdős, “Choosability in graphs”: it has 241 citations (quite high for a pure math paper), and choosability is an important subtopic of graph coloring theory
— User:David, 04:12, 30 July 2008 (UTC)
Stance: comment
Cited policy: WP:PROF (Wikipedia:Notability)