A set X of vertices of a graph is irredundant if the closed neighbourhood of each x ϵ X is not contained in the union of closed neighbourhoods of the vertices of X − {x}. The upper irredundance number, IR(G) is the largest number of vertices in any irredundant set of G. We prove that for any p-vertex graph G, and exhibit all graphs which attain this bound.