Changes
Minimum cut of hypergraphic matroids -- ~~~~
== Minimum cut of hypergraphic matroids -- [[User:Tkiraly|Tamás Király]] 14:54, 28 December 2009 (UTC) ==
A special case of (hypergraphic) count matroids is the class of ''k''-circuit matroids of hypergraphs, see [[Hypergraphic matroid]]. In [http://www.cs.elte.hu/egres/qp/egresqp-09-05.pdf Egres Quick Proof No. 2009-05] I described how the minimum cut can be found in polynomial time in this case.
A special case of (hypergraphic) count matroids is the class of ''k''-circuit matroids of hypergraphs, see [[Hypergraphic matroid]]. In [http://www.cs.elte.hu/egres/qp/egresqp-09-05.pdf Egres Quick Proof No. 2009-05] I described how the minimum cut can be found in polynomial time in this case.
