On matroids on edge sets of graphs with connected subgraphs as circuits
Abstract: It is proved that if is a finite family of connected, finite graphs, then a graph exists such that the subgraphs of isomorphic to a member of the family cannot be regarded as the circuits of a matroid on the edge set of .
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05B35
Retrieve articles in all journals with MSC: 05B35
Keywords: Matroid, graph, matroid circuit, subgraph, subgraphs as matroid circuits
Article copyright: © Copyright 1973 American Mathematical Society