Combinatorial structures: graphs, matroids and lattice paths
Research focus
The Peer review has evaluated this group as Average
The main research concerns the study of topological, algebraic and enumerative properties of combinatorial structures such as graphs, matroids, lattice paths and (0,1) matrices. 1. Structural and enumerative properties of graphs Many structural and enumerative problems of graphs have been considered, with particular attention to the Fibonacci cubes and some generalizations. These graphs, which have been introduced as a new architecture for multiprocessors systems, turn out to be isomorphic to the Hasse diagram of the distributive lattice of order ideals of fences and crowns. J1, J2, J4, J7, J9, J17, J20, O1, P2. 2. Bijective and enumerative combinatorics The combinatorics of finite sets, ordered structures, permutations and lattice paths is treated by using the methods of formal power series, formal languages and species. J5, J6, J10, J11, J12, J13, J14, J15, J18, P1, P3, P4. 3. Matrices In order to enumerate combinatorial structures, the permanent of (0,1) matrices, decompositions of generalized circulant (0,1) matrices and the genus of bipartite graphs associated with these matrices in the usual way have been considered. J3, J19. 4. Matroids Results have been obtained in relation to a base-matroid of a matroid, a notion which arises in the field of inverse combinatorial optimization problems. J8, J16. The group collaborates with other research groups of Politecnico di Milano and other Institutions.
Dipartimento di afferenza
Docenti afferenti
Full Professors
Norma Zagaglia
Associate Professors
Claudio Perelli Cippo
Assistant Professors
Ezia Maria Aragno
Ernesto Dedò
Federico Lastaria
Emanuele Munarini