Several properties of the inner bound on the region of entropic vectors obtained from representable matroids are derived. In particular, it is shown that: I) It suffices to check size 2 minors of an integer-valued vector to determine if it is a valid matroid rank; II) the subset of the extreme rays of the Shannon outer bound (the extremal polymatroids) that are matroidal are also the extreme rays of the cone of matroids; III) All matroid ranks are convex independent; and IV) the extreme rays of the conic hull of the binary/ternary/quaternary representable matroid ranks inner bound are a subset of the extreme rays of the conic hull of matroid ranks. These properties are shown to allow for substantial reduction in the complexity of calculating important rate regions in multiterminal information theory, including multiple source multicast network coding capacity regions.