z

main.tex

@@ -178,8 +178,10 @@ for any base $B$ of $M'$, the expected size of intersection is at most $O(k')$.
 A counterexample would be uniform matroids $U_{2n,n}$.
 The size of every $k'$-cocycle is $k'+n$, and for any $k'$-cocycle there are bases using $O(n)$ elements in the cocycle.
 
-\paragraph{Nice properties}
-$\cl(F+e)\setminus F$ is a partition of $E\setminus F$ for general matroids.
+\begin{proposition}
+Let $M=(E,\mathcal I)$ be a matroids and let $F$ be a flat of $M$.
+Then $\cl(F+e)\setminus F$ is a partition of $E\setminus F$.
+\end{proposition}
 
 \subsection{Support size}
 
@@ -192,7 +194,7 @@ The strategy is to first find a $\geq k$-cocycle using the utilization algorithm
 Note that LP gives an ideal tree packing with $O(m)$ support size.
 
 \subsection{Rigidity matroids}
-\begin{conjecture}\label{conj:idealrigidbase}
+\begin{conjecture}
 Let $M$ be a connected 2D rigidity matroid on graph $G=(V,E)$. Let $F^*$ be the optimal flat for strength $F^*=\argmin_{F\subset E}\frac{c(E\setminus F)}{r(E)-r(F)}$.
 Let $X\subset E\setminus F^*$ be a independent set with rank $r(E)-r(F^*)$. Then for any maximal independent set $B_{F^*}\subset F^*$, $X\cup B_{F^*}$ is a base of $M$.
 \end{conjecture}