Partial ordering is a binary relation over a set that is reflexive, antisymmetric, and transitive, allowing for the comparison of elements in a non-linear hierarchy. Unlike total ordering, not all elements in a partially ordered set are necessarily comparable, making it suitable for representing structures like hierarchies or dependencies where some elements are incomparable.