On the graphic matroid parity problem (Q1400959)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1965031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the graphic matroid parity problem |
scientific article; zbMATH DE number 1965031 |
Statements
On the graphic matroid parity problem (English)
0 references
17 August 2003
0 references
A new proof is given of the min-max theorem of Lovász on the graphic matroid problem. The proof is based on existing proofs of Tutte's matching theorem. A matroid is graphic if it is the cycle matroid of some graph. Given a graph \(G\) and a partition \(V\) of its edge set into pairs, \((G, V)\) is called a \(v\)-graph, and a \(v\)-forest of \((G, V)\) is a forest of \(G\) consisting of \(v\)-pairs in \(V\). The graphic matroid problem is to find the maximum number of \(v\)-pairs in a \(v\)-forest in a \(v\)-graph.
0 references
graphic matroid
0 references
0.8079674243927002
0 references
0.8035256266593933
0 references
0.7962825894355774
0 references
0.7897343039512634
0 references
0.7775707840919495
0 references
