On matroidal families

Simoes-Pereira has defined [5,6,7] a matroidal family of graphs and has proved the existence of four matroidal families, called F"1F"2F"3and F"4 the set of polygons [@d]. Andreae [1] has shown that for every n, integer, n>=2, there is a matroidal family M"n (F"4=M"2, F"1=M"3). It is the purpose of the present hole to build a set of matroidal families containing all the M"n, F"2 and an infinity of other matroidal families.