On binary reducibility (Q1109039): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:06, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On binary reducibility |
scientific article |
Statements
On binary reducibility (English)
0 references
1988
0 references
Lovász and the reviewer proved that a connected graphic matroid M is the sum of two matroids of rank at least one if and only if M-e is disconnected for at least one element e. Cunningham generalized this for binary maroids. The present author gives a shorter proof for the general result, using geometric ideas of Mason and a theorem of Lucas on rank preserving weak maps.
0 references
connected graphic matroid
0 references
sum of two matroids
0 references
binary maroids
0 references
general result
0 references
geometric ideas
0 references
rank preserving weak maps
0 references
