Abstract (EN)

This chapter discusses the bouquets of geometric lattices. Matroid theory is in the center of Combinatorics, Finite Geometry, Lattice theory and Combinatorial Optimization. During the last decades, extensive search was done to find a good degree of generality which still preserves the validity of deep results known for matroids. One of such generalizations is the concept of bouquet of matroids. Following features of bouquets are presented in the chapter: other operations (contraction, restriction and cuts), strong maps and mapping cylinders, representability, topological aspects and, in particular, shellability of various simplicial complexes associated with bouquets and relation with connectivity properties. It is suggested that Wachs and Walker principal concepts and results (strong map, mapping cylinder, realization theorem) stated for geometric semilattices could be naturally extended for the broader framework of bouquets.