Article révisé par les pairs
| Résumé : | Simoes-Pereira has defined [5,6,7] a matroidal family of graphs and has proved the existence of four matroidal families, called F1 F2 F3and F4 the set of polygons [δ]. Andreae [1] has shown that for every n, integer, n≥2, there is a matroidal family Mn (F4=M2, F1=M3). It is the purpose of the present hole to build a set of matroidal families containing all the Mn, F2 and an infinity of other matroidal families. © 1979. |
