Graphs, matroids, and geometric lattices

Abstract

It is shown that two triply connected graphs are isomorphic if their associated geometric lattices are isomorphic. The notion of vertex in a graph is described in terms of irreducible hyperplanes. Finally, necessary and sufficient conditions are given that a lattice be isomorphic to the geometric lattice associated with a graph.