A polyhedron having vertices is called integer if all of its vertices are integer. This property is coNP-complete in general. Recognizing integral set-packing polyhedra is one of the biggest challenges of graph theory (perfectness test). Various other special cases are major problems of discrete mathematics.