arXiv:2611.09633v1 Announce Type: cross Abstract: Characteristic imset polytopes are convex hulls of a collection of characteristic imset vectors, which are 0/1 vectors that encode the Markov equivalence class of a directed acyclic graph. These polytopes are the feasible region of linear programs which correspond to causal discovery problems. We introduce a new family of these polytopes whose vertices correspond to directed acyclic graphs with in-degree bounded by $k$. This yields a polytope whose dimension is only polynomial in the number of nodes of the underlying graphs instead of exponential. We show that when $k = 1$, this polytope is a matroid independence polytope. For $k = 2$ we provide several large families of facet-defining inequalities, which give a complete $\mathcal{H}$-representation of the polytope on four nodes.