On binary reducibility (Q1109039)
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 4068892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On binary reducibility |
scientific article; zbMATH DE number 4068892 |
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
0.7850701212882996
0 references
0.7803716063499451
0 references
0.7786440253257751
0 references
0.7786440253257751
0 references
