Integer Partitions from the Polyhedral Point of View

We characterize integer partitions that are convex combinations of two partitions, which connects vertices of the partition polytopes with Sidon sets and sum-free sets. We prove that all vertices of the partition polytope can be generated from a subset of support vertices with the use of two operations of merging parts. Application of either operation results in an adjacent vertex. We present also some numerical data on vertices.