A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. A maximum irredundant set is always maximal, but the converse does not necessarily hold.
