Séminaire Lotharingien de Combinatoire, B09g (1983), 28 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1984, 230/S-09, p.
84-111.]
Norbert Seifter
Permanenten in der Kombinatorik
Abstract.
This survey article discusses the following problem areas:
-
The enumeration of Latin rectangles.
-
The determination of the characteristic constants in the dimer problem.
-
The enumeration of non-isomorphic Steiner triple systems.
-
The enumeration of 1-factors of graphs.
-
The determination of the number of Eulerian orientations of graphs.
-
The characterization of convertible (0,1)-matrices.
-
The permanent polynomial of graphs.
The following version is available: