| Article ID: | iaor19962189 |
| Country: | United States |
| Volume: | 1 |
| Issue: | 1 |
| Start Page Number: | 15 |
| End Page Number: | 19 |
| Publication Date: | Apr 1995 |
| Journal: | International Journal of Operations and Quantitative Management |
| Authors: | Harary Frank |
| Keywords: | graphs |
As all graphs have associated matroids but not all matroids are graphical, there is a natural ‘algorithm’ for generating open problems in matroid theory. This well known approach considers a concept and its theorems in graph theory and seeks to generalize them to matroid theory. An indication of some of the successful generalizations will be given. In addition some new topics will be suggested as unsolved problems in this expository note.