Paving
A matroid of rank $r$ is paving if every circuit has at least $r$ elements, i.e. every set of fewer than $r$ elements is independent. For a rank-3 matroid this means no loops and no parallel elements. Copied from polyDB (PAVING).
A matroid of rank $r$ is paving if every circuit has at least $r$ elements, i.e. every set of fewer than $r$ elements is independent. For a rank-3 matroid this means no loops and no parallel elements. Copied from polyDB (PAVING).