Changes
<onlyinclude>
Does there exists a polynomial ''p'', such that for any [[gammoid]] <math>\Gamma</math> on a node set ''S'', we can find there exists a digraph ''D=(V,A)'' with <math>S,U\subseteq V</math> defining <math>\Gamma</math>, so that <math>|V|\le p(|S|)</math>?
</onlyinclude>
==Remarks==
This question was proposed by Mihály Bárász. It is easy to verify that we can choose ''D=(V,A)'' with <math>S,U\subseteq V</math> defining <math>\Gamma</math>
so that <math>|U|=r(\Gamma)</math>. The question is if <math>|V-(S\cup U)|</math> can also be bounded.
[[Category:Open Problems]]
[[Category:Matroids]]
